1410 search results - page 247 / 282 » The Algorithmics of Solitaire-Like Games |
ML
2006
ACM
14 years 9 months ago
2006
ACM
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
71
Voted
CIE
2010
Springer
15 years 1 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
96
Voted
ACMACE
2009
ACM
15 years 26 days ago
2009
ACM
Nowadays, video games propose rich scenarios with movementsbased game play, through the manipulation of dedicated devices. The motivation of this study is the elaboration of a com...
AAAI
2008
14 years 12 months ago
2008
Security at major locations of economic or political importance is a key concern around the world, particularly given the threat of terrorism. Limited security resources prevent f...