1403 search results - page 25 / 281 » On Communication in Solving Distributed Constraint Satisfact... |
AMAI
1999
Springer
14 years 9 months ago
1999
Springer
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
76
Voted
CP
1995
Springer
15 years 1 months ago
1995
Springer
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
AI
2005
Springer
14 years 9 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...
AAAI
2007
14 years 12 months ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
CAEPIA
2003
Springer
15 years 2 months ago
2003
Springer
Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constr...