942 search results - page 62 / 189 » Distance Constraint Satisfaction Problems |
SBACPAD
2003
IEEE
15 years 3 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...
CPAIOR
2004
Springer
15 years 3 months ago
2004
Springer
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP4 . In this paper, we propose a specific methodology for tackling uncertainties in this...
CP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
FLAIRS
2007
15 years 8 days ago
2007
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...