1599 search results - page 216 / 320 » Algorithms for Parity Games |
174
click to vote
EVOW
2010
Springer
16 years 24 days 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...
141
click to vote
CEC
2007
IEEE
16 years 20 days 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 ...
129
click to vote
COLT
2004
Springer
15 years 11 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...
156
click to vote
FLAIRS
2006
15 years 7 months ago
2006
In this paper, we apply artificial neural networks to control the targeting system of a robotic tank in a tank-combat computer game (RoboCode). We suggest an algorithm that not on...
186
click to vote
STOC
2009
ACM
16 years 7 months 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...