Sciweavers

2398 search results - page 61 / 480
» Constraint Programming and Graph Algorithms
Sort
View
CP
2006
Springer
15 years 8 months ago
Reasoning by Dominance in Not-Equals Binary Constraint Networks
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
Belaid Benhamou, Mohamed Réda Saïdi
ESA
2009
Springer
112views Algorithms» more  ESA 2009»
15 years 11 months ago
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
Johan M. M. van Rooij, Hans L. Bodlaender, Peter R...
CINQ
2004
Springer
182views Database» more  CINQ 2004»
15 years 8 months ago
Mining Constrained Graphs: The Case of Workflow Systems
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
Gianluigi Greco, Antonella Guzzo, Giuseppe Manco, ...
EOR
2007
80views more  EOR 2007»
15 years 4 months ago
Exploiting nested inequalities and surrogate constraints
The exploitation of nested inequalities and surrogate constraints as originally proposed in Glover [Glover, F., 1965. A multiphase-dual algorithm for the zero–one integer progra...
Saïd Hanafi, Fred Glover
122
Voted
CIKM
2011
Springer
14 years 4 months ago
Conkar: constraint keyword-based association discovery
In many domains, such as bioinformatics, cheminformatics, health informatics and social networks, data can be represented naturally as labeled graphs. To address the increasing ne...
Mo Zhou, Yifan Pan, Yuqing Wu