419 search results - page 32 / 84 » An LP-Designed Algorithm for Constraint Satisfaction |
115
click to vote
AUSAI
2005
Springer
15 years 5 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...
117
click to vote
SBACPAD
2003
IEEE
15 years 8 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...
126
click to vote
CP
2001
Springer
15 years 7 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...
130
click to vote
AAAI
1997
15 years 4 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 ...
168
click to vote
PACT
1999
Springer
15 years 7 months 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 ...