Sciweavers

CONSTRAINTS
2010
75views more  CONSTRAINTS 2010»
13 years 2 months ago
Redundant modeling in permutation weighted constraint satisfaction problems
Yat Chiu Law, Jimmy Ho-Man Lee, May H. C. Woo
CONSTRAINTS
2010
153views more  CONSTRAINTS 2010»
13 years 2 months ago
Philosophy of the MiniZinc challenge
MiniZinc arose as a response to the extended discussion at CP2006 of the need for a standard modelling language for CP. This is a challenging problem, and we believe MiniZinc makes...
Peter J. Stuckey, Ralph Becket, Julien Fischer
CONSTRAINTS
2010
116views more  CONSTRAINTS 2010»
13 years 2 months ago
Enabling local computation for partially ordered preferences
Abstract. Many computational problems linked to uncertainty and preference management can be expressed in terms of computing the marginal(s) of a combination of a collection of val...
Hélène Fargier, Emma Rollon, Nic Wil...
CONSTRAINTS
2010
193views more  CONSTRAINTS 2010»
13 years 2 months ago
Constraint propagation on quadratic constraints
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...
Ferenc Domes, Arnold Neumaier
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 2 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
CONSTRAINTS
2010
110views more  CONSTRAINTS 2010»
13 years 2 months ago
Solving subgraph isomorphism problems with constraint programming
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Stéphane Zampelli, Yves Deville, Christine ...
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
13 years 4 months ago
Evaluating the impact of AND/OR search on 0-1 integer linear programming
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
Radu Marinescu 0002, Rina Dechter
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
13 years 4 months ago
Constraint models for graceful graphs
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...
Barbara M. Smith, Jean-François Puget
CONSTRAINTS
2010
89views more  CONSTRAINTS 2010»
13 years 4 months ago
Improving inter-block backtracking with interval Newton
Bertrand Neveu, Gilles Trombettoni, Gilles Chabert
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 4 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...