419 search results - page 32 / 84 » An LP-Designed Algorithm for Constraint Satisfaction |
AUSAI
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Methods of adaptive constraint satisfaction have recently become of interest to overcome the limitations imposed on “black-box” search algorithms by the no free lunch...
SBACPAD
2003
IEEE
14 years 1 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
CP
2001
Springer
14 years 1 months ago
2001
Springer
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
AAAI
1997
13 years 9 months ago
1997
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
PACT
1999
Springer
14 years 22 days ago
1999
Springer
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...