Sciweavers

314 search results - page 2 / 63
» A non-binary constraint ordering heuristic for constraint sa...
Sort
View
AAAI
1997
13 years 7 months ago
Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
Aaron A. Armstrong, Edmund H. Durfee
ECAI
1992
Springer
13 years 9 months ago
Arc-Consistency for Non-Binary Dynamic CSPs
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
Christian Bessière
AUSAI
2003
Springer
13 years 10 months ago
Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
Lingzhong Zhou, John Thornton, Abdul Sattar
FLAIRS
2004
13 years 7 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
FLAIRS
2007
13 years 8 months ago
Search Ordering Heuristics for Restarts-Based Constraint Solving
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...
Margarita Razgon, Barry O'Sullivan, Gregory M. Pro...