Sciweavers

419 search results - page 28 / 84
» An LP-Designed Algorithm for Constraint Satisfaction
Sort
View
AAAI
1994
13 years 9 months ago
A Filtering Algorithm for Constraints of Difference in CSPs
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
Jean-Charles Régin
ECAI
2004
Springer
14 years 1 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière
TIME
2002
IEEE
14 years 1 months ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
FLAIRS
2003
13 years 9 months ago
A Graph Based Synthesis Algorithm for Solving CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
Wanlin Pang, Scott D. Goodwin
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 8 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher