1698 search results - page 30 / 340 » Growing Complex Games |
EVOW
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Behaviour trees provide the possibility of improving on existing Artificial Intelligence techniques in games by being simple to implement, scalable, able to handle the c...
DIGRA
2005
Springer
15 years 3 months ago
2005
Springer
In huge online games where great numbers of players can be connected at the same time, social interaction is complex and conflicts become part of everyday life. There is a set of ...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
77
Voted
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...