99 search results - page 5 / 20 » Search Techniques for Non-linear Constraint Satisfaction Pro... |
JAIR
2000
13 years 6 months ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
AI
2005
Springer
13 years 6 months ago
2005
Springer
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly...
SARA
2007
Springer
14 years 24 days ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
CONSTRAINTS
2002
13 years 6 months ago
2002
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring tha...
ECAI
2008
Springer
13 years 8 months ago
2008
Springer
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...