955 search results - page 9 / 191 » A System for Solving Constraint Satisfaction Problems with S... |
CAD
1999
Springer
13 years 7 months ago
1999
Springer
The numerical approach to solving geometric constraint problems is indispensable for building a practical CAD system. The most commonly-used numerical method is the Newton
AAMAS
2000
Springer
13 years 7 months ago
2000
Springer
When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distrib...
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
IJIT
2004
13 years 9 months ago
2004
Cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given. But none of them can solve the problem intelligently using...
AAAI
2006
13 years 9 months ago
2006
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...