1599 search results - page 176 / 320 » Algorithms for Parity Games |
184
Voted
ACMACE
2006
ACM
16 years 1 months ago
2006
ACM
Massively multiplayer online computer games are played in complex, persistent virtual worlds. Over time, the landscape of these worlds evolves and changes as players create and pe...
174
click to vote
CW
2005
IEEE
16 years 19 days ago
2005
IEEE
This paper studies the way to improve consistency of states in a ball-game typed Distributed Virtual Environment (DVE) with lag, in peer-to-peer (P2P) architecture. That is, we ar...
162
Voted
ECAI
2004
Springer
16 years 12 days 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...
208
Voted
AAAI
2007
15 years 9 months ago
2007
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...
155
Voted
AAAI
2000
15 years 8 months ago
2000
Maxn (Luckhardt and Irani, 1986) is the extension of the minimax backup rule to multi-player games. We have shown that only a limited version of alpha-beta pruning, shallow prunin...