155 search results - page 10 / 31 » A Conflict Tabu Search Evolutionary Algorithm for Solving Co... |
110
Voted
ECAI
2004
Springer
15 years 9 months ago
2004
Springer
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
126
Voted
AAMAS
2000
Springer
15 years 3 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...
144
Voted
AI
2003
Springer
15 years 9 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
177
Voted
PACT
1999
Springer
15 years 8 months ago
1999
Springer
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...
134
Voted
EVOW
2010
Springer
15 years 7 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...