11 search results - page 2 / 3 » Move-Pruning Techniques for Monte-Carlo Go |
DATE
2008
IEEE
14 years 25 days ago
2008
IEEE
Single-electron devices have drawn much attention in the last two decades. They have been widely used for device research and also show promise as a potential alternative to compl...
ICGA
2007
13 years 6 months ago
2007
Abstract. Move patterns are an essential method to incorporate domain knowledge into Go-playing programs. This paper presents a new Bayesian technique for supervised learning of su...
AAAI
2008
13 years 8 months ago
2008
The aim of General Game Playing (GGP) is to create intelligent agents that automatically learn how to play many different games at an expert level without any human intervention. ...
ICML
2007
IEEE
14 years 7 months ago
2007
IEEE
The UCT algorithm learns a value function online using sample-based search. The TD() algorithm can learn a value function offline for the on-policy distribution. We consider three...
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
— Multi-agent coordination problems can be cast as distributed optimization tasks. Probability Collectives (PCs) are techniques that deal with such problems in discrete and conti...