Sciweavers

858 search results - page 87 / 172
» A Glimpse of Constraint Satisfaction
Sort
View
ECAI
2008
Springer
13 years 9 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
JAIR
2010
145views more  JAIR 2010»
13 years 6 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 8 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang
KBS
2007
56views more  KBS 2007»
13 years 7 months ago
Domain-dependent distributed models for railway scheduling
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
Miguel A. Salido, Montserrat Abril, Federico Barbe...
CP
2009
Springer
14 years 8 months ago
Asynchronous Inter-Level Forward-Checking for DisCSPs
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
Redouane Ezzahir, Christian Bessiere, Mohamed Wahb...