70 search results - page 5 / 14 » Thumbs-Up: a game for playing to rank search results |
CG
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
IEEECIT
2007
IEEE
14 years 2 days ago
2007
IEEE
Search engines are playing a more and more important role in discovering information nowadays. Due to limitations of time-consuming, network bandwidth and hardwares, we cannot obt...
ML
2000
ACM
13 years 5 months ago
2000
ACM
In this paper we present TDLEAF( ), a variation on the TD( ) algorithm that enables it to be used in conjunction with game-tree search. We present some experiments in which our che...
CG
2002
Springer
13 years 5 months ago
2002
Springer
The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents oth...
AAAI
2010
13 years 7 months ago
2010
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...