1410 search results - page 137 / 282 » The Algorithmics of Solitaire-Like Games |
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
We define the class of games called simulation-based games, in which the payoffs are available as an output of an oracle (simulator), rather than specified analytically or using a...
91
Voted
EVOW
2010
Springer
15 years 6 months ago
2010
Springer
Monte Carlo Tree Search is a recent algorithm that achieves more and more successes in various domains. We propose an improvement of the Monte Carlo part of the algorithm by modify...
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper, we report on our experiments with using Monte Carlo simulation (specifically the UCT algorithm) as the basis for an Othello playing program. Monte Carlo methods ...
COLT
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We provide a natural learning process in which the joint frequency of empirical play converges into the set of convex combinations of Nash equilibria. In this process, al...
106
click to vote
STOC
2009
ACM
16 years 6 days ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...