Sciweavers

800 search results - page 47 / 160
» On the Complexity of Parity Games
Sort
View
AIIDE
2008
13 years 11 months ago
Offline Planning with Hierarchical Task Networks in Video Games
Artificial intelligence (AI) technology can have a dramatic impact on the quality of video games. AI planning techniques are useful in a wide range of game components, including m...
John Paul Kelly, Adi Botea, Sven Koenig
SIGECOM
2006
ACM
115views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Multi-attribute coalitional games
We study coalitional games where the value of cooperation among the agents are solely determined by the attributes the agents possess, with no assumption as to how these attribute...
Samuel Ieong, Yoav Shoham
GECCO
2008
Springer
149views Optimization» more  GECCO 2008»
13 years 10 months ago
Real-time imitation-based adaptation of gaming behaviour in modern computer games
In the course of the recent complexification and sophistication of commercial computer games, the creation of competitive artificial players that are able to behave intelligentl...
Steffen Priesterjahn, Alexander Weimer, Markus Ebe...
FSTTCS
2008
Springer
13 years 10 months ago
Explicit Muller Games are PTIME
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
Florian Horn
LICS
2008
IEEE
14 years 3 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski