Sciweavers

1245 search results - page 16 / 249
» Playing with Conway's problem
Sort
View
SIAMCOMP
2002
124views more  SIAMCOMP 2002»
13 years 7 months ago
The Nonstochastic Multiarmed Bandit Problem
Abstract. In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This class...
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freun...
ATAL
2008
Springer
13 years 9 months ago
Emerging coordination in infinite team Markov games
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...
Francisco S. Melo, M. Isabel Ribeiro
ML
1998
ACM
148views Machine Learning» more  ML 1998»
13 years 7 months ago
Colearning in Differential Games
Game playing has been a popular problem area for research in artificial intelligence and machine learning for many years. In almost every study of game playing and machine learnin...
John W. Sheppard
SIGSOFT
2007
ACM
14 years 8 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
14 years 10 days ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek