800 search results - page 62 / 160 » On the Complexity of Parity Games |
CG
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
AIIDE
2006
13 years 10 months ago
2006
In most modern video games, character behavior is scripted; no matter how many times the player exploits a weakness, that weakness is never repaired. Yet if game characters could ...
FUNGAMES
2010
13 years 10 months ago
2010
Autonomic Computing is now showing its value as a solution to the increased complexities of maintaining computer systems and has been applied to many different fields. In this pap...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
AI
2002
Springer
13 years 9 months ago
2002
Springer
Hex is a beautiful game with simple rules and a strategic complexity comparable to that of Chess and Go. The massive game-tree search techniques developed mostly for Chess and suc...