Sciweavers

942 search results - page 79 / 189
» Distance Constraint Satisfaction Problems
Sort
View
ECAI
2008
Springer
14 years 11 months ago
Hybrid tractable CSPs which generalize tree structure
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
Martin C. Cooper, Peter G. Jeavons, András ...
SAC
2003
ACM
15 years 3 months ago
Coordination-Based Distributed Constraint Solving in DICE
DICE (DIstributed Constraint Environment) is a framework for the construction of distributed constraint solvers from software components in a number of predefined categories. The...
Peter Zoeteweij
TACAS
2010
Springer
251views Algorithms» more  TACAS 2010»
15 years 3 months ago
Approximating the Pareto Front of Multi-criteria Optimization Problems
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
Julien Legriel, Colas Le Guernic, Scott Cotton, Od...
MST
2008
124views more  MST 2008»
14 years 10 months ago
Complexity of Clausal Constraints Over Chains
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
Nadia Creignou, Miki Hermann, Andrei A. Krokhin, G...
CP
2008
Springer
14 years 11 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...