112 search results - page 7 / 23 » Searching Game Trees in Parallel Using SSS |
53
Voted
ICMCS
2006
IEEE
15 years 3 months ago
2006
IEEE
At present, the researchers are making great effort to search for a general purpose resolution for image segmentation. Most of the approaches we are using now are somewhat ineffic...
ICGA
2008
14 years 9 months ago
2008
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....
103
click to vote
FCT
2003
Springer
15 years 2 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
73
Voted
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
Unlike traditional game playing, General Game Playing is concerned with agents capable of playing classes of games. Given the rules of an unknown game, the agent is supposed to pla...
77
Voted
AAAI
2010
14 years 11 months ago
2010
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...