A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Algorithmic aspects of disjunctive domination in graphs
[article]

2015
*
arXiv
*
pre-print

The cardinality

arXiv:1502.07718v2
fatcat:iixjzu637vcd5ldwx7dzmxc5hu
*of*a minimum*disjunctive**dominating*set*of*G is called the*disjunctive**domination*number*of**graph*G, and is denoted by γ_2^d(G). ...*In*this article, we first propose a linear time*algorithm*for MDDP*in*proper interval*graphs*. ...*In*Section 3, we design a linear time*algorithm*for*disjunctive**domination*problem*in*proper interval*graphs*, an important subclass*of*chordal*graphs*. ...##
###
Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
[chapter]

1997
*
Lecture Notes in Computer Science
*

*In*the end, we also propose a refined version

*of*the "edge-finding"

*algorithm*for cumulative resources which, despite its worst case complexity

*in*O(n 3 ), performs very well on highly cumulative instances ... Within the cumulative scheduling class, we distinguish between "highly

*disjunctive*" and "highly cumulative" problems: a problem is highly

*disjunctive*when many pairs

*of*activities cannot execute

*in*parallel ... Given a directed

*graph*G = (X, E), G' = (X, E') is the transitive closure

*of*G if and only if ∀x ∈ X, ∀y ∈ X, (x, y) ∈ E' if and only if there exists a directed path from x to y

*in*E. 4. ...

##
###
Identifying semantic differences in AspectJ programs

2009
*
Proceedings of the eighteenth international symposium on Software testing and analysis - ISSTA '09
*

*In*this paper we propose an approach for difference analysis

*of*

*aspect*-oriented programs. ...

*In*accordance with these signatures, and with those existent for elements

*of*the Java language, we investigate a set

*of*signature patterns to be used with the module matching

*algorithm*. ... with patterns for the

*disjunctive*matcher. • It applies the hammock

*graph*comparison

*algorithm*to

*aspect*-oriented programs. • It gives a set

*of*evaluations to show the effectiveness and feasibility

*of*...

##
###
Modelling and managing disjunctions in scheduling problems

1995
*
Journal of Intelligent Manufacturing
*

Taking account

doi:10.1007/bf00123685
fatcat:7ejtzkuq2vdutpslpfr7ew55y4
*of*resource constraints leads to defining*disjunctive*constraints. To this end,*disjunctive*sets*of*arcs are introduced, making the TBON*graph*non conjunctive. ...*In*order to model a larger variety*of*temporal constraints, particularly any constraint that connects two events (start-or finish-time*of*a task), we propose a model called a Time-Bound-On-Node*graph**in*...*In*the*disjunctive*case, an*algorithm*provides answers to the schedule feasibility. ...##
###
Page 6281 of Mathematical Reviews Vol. , Issue 2003h
[page]

2003
*
Mathematical Reviews
*

If a decom- position tree

*of*the*graph*is given, the*algorithm*uses logarithmic time, and the product*of*time and number*of*processors is linear*in*the number*of*vertices. ... .], we concentrate here on the mathematical*aspects**of*the analysis. From these elemen- tary considerations it follows that the average time complexities*of*the non-naive*algorithms*are O(7). ...##
###
Scheduling Abstractions for Local Search
[chapter]

2004
*
Lecture Notes in Computer Science
*

This paper presents a collection

doi:10.1007/978-3-540-24664-0_22
fatcat:r3fubyphw5febe2uyaf2vbe2qa
*of*abstractions, inspired by constraint-based schedulers, to simplify scheduling*algorithms*by local search*in*Comet. ... Its core is a precedence*graph*which incrementally maintains a candidate schedule at every computation step. ... (*algorithm*LSRW) which typically*dominates*[17] . ...##
###
Word Sense Discovery for Web Information Retrieval

2008
*
2008 IEEE International Conference on Data Mining Workshops
*

Discovering such

doi:10.1109/icdmw.2008.10
dblp:conf/icdm/NykielR08
fatcat:6qu3wyybbrhm3ov7faymmvbtoq
*dominated*meanings can significantly improve quality*of*many text-related*algorithms*.*In*particular, web search quality can be leveraged. ... One*of*the problems, faced*in*automatic word sense discovery, is the number*of*different senses a word can have. Often, senses are*dominated*by some other, more frequent ones. ... Dorow and Widdows*in*[3] present an unsupervised*algorithm*for WSD, based on a*graph*model, to overcome this issue. The*graph*represents words and relationships between them. ...##
###
A new technique of selecting an optimal blocking method for better record linkage

2018
*
Information Systems
*

the

doi:10.1016/j.is.2018.06.006
fatcat:nln32rg3enbz5capojfeeavo5u
*dominance**graph*described*in*Section 4.2. ... The existence*of*a non-*dominated*node is guaranteed within a*dominance**graph*. ...##
###
Scheduling trains as a blocking parallel-machine job shop scheduling problem

2009
*
Computers & Operations Research
*

classical

doi:10.1016/j.cor.2008.12.012
fatcat:pb7splawhvdelkkkothmwhng4m
*disjunctive**graph*models. ... Inspired by the proposed SBP*algorithm*, Feasibility Satisfaction Procedure (FSP)*algorithm*is developed to solve and analyse the BPMJSS problem, by an alternative*graph*model that is an extension*of*the ... If the direction*of*this train is outbound, most*of*the above formulae are used*in*the same fashion but*in*a reverse direction. ...##
###
Complexity of the game domination problem

2016
*
Theoretical Computer Science
*

*In*this paper we show that verifying whether the game

*domination*number

*of*a

*graph*is bounded by a given integer is PSPACEcomplete. ... The game

*domination*number is a

*graph*invariant that arises from a game, which is related to

*graph*

*domination*

*in*a similar way as the game chromatic number is related to

*graph*coloring. ... The game

*domination*number has been studied also from several additional

*aspects*(see [5, 7, 11] ), nevertheless the

*algorithmic*complexity

*of*determining γ g (G) for a given

*graph*G was not yet studied ...

##
###
Emotionally Colorful Reflexive Games
[article]

2010
*
arXiv
*
pre-print

The major advantages

arXiv:1101.0820v1
fatcat:iu5j2gw27bbbpfkqaqczzbv5oa
*of*RGT are its ability to predict human behavior and unfold the entire spectra*of*reflexion*in*the human mind. ... Up to date, EGR is a unique methodology capable*of*modeling human reflexive processes and emotional*aspects*simultaneously. ... Besides, the RGT allows to unfold the entire sequence*of*reflexion*in*the human mind including its emotional*aspects*. ...##
###
Optimization of Bound Disjunctive Queries with Constraints
[article]

2004
*
arXiv
*
pre-print

The main contribution

arXiv:cs/0406013v1
fatcat:3mrh544psjdg7kd32c3soteq3a
*of*the paper consists*in*the extension*of*a previous technique, defined for positive*disjunctive*queries, to queries containing both*disjunctive*heads and constraints (a simple and ... "To Appear*in*Theory and Practice*of*Logic Programming (TPLP)" This paper presents a technique for the optimization*of*bound queries over*disjunctive*deductive databases with constraints. ... Magic-Partial). k-*DOMINATING*SET. Given a*graph*G = V , E , a subset*of*the vertex set V ′ ⊆ V is a*dominating*set if for all u ∈ V − V ′ there is a v ∈ V ′ for which (u, v ) ∈ E . ...##
###
An implementation model for contexts and negation in conceptual graphs
[chapter]

1995
*
Lecture Notes in Computer Science
*

*of*existing retrieval

*algorithms*, such as Levinson's Method III and UDS, to handle complex referents and nested contexts, the checking

*of*consistency, and the de nition

*of*Peirce's inference rules

*in*... The issues tackled

*in*the paper lay the foundation for a full scale

*graph*-based rst-order logic theorem prover. ...

*Disjunctions*are represented by allowing negative

*graphs*. ...

##
###
The Parameterized Complexity of Counting Problems

2004
*
SIAM journal on computing (Print)
*

More explicitly, our result shows that most likely there is no f (k) · n c -

doi:10.1137/s0097539703427203
fatcat:auo3obkzebf5rd4ruyxriwdheq
*algorithm*for counting cycles or paths*of*length k*in*a*graph**of*size n for any computable function f : N → N and constant c, ... Our main result states that counting cycles and paths*of*length k*in*both directed and undirected*graphs*, parameterized by k, is #W[1]-complete. ... The hardness*of*the cycle counting problem*in*undirected*graphs*may be surprising*in*view*of*another*algorithm*due to Alon, Yuster, and Zwick [3] showing that cycles up to length 7*in*an undirected*graph*...##
###
Page 6047 of Mathematical Reviews Vol. , Issue 2002H
[page]

2002
*
Mathematical Reviews
*

Summary: “We propose a new style

*of*writing*graph**algorithms**in*functional languages which is based on an alternative view*of**graphs*as inductively defined data types. ... We also regard this as a contribution to the teaching*of**algorithms*and data structures*in*functional languages since we can use the functional-style*graph**algorithms*instead*of*the imperative*algorithms*...
« Previous

*Showing results 1 — 15 out of 5,005 results*