88 search results - page 7 / 18 » A Parallel Monte-Carlo Tree Search Algorithm |
90
Voted
ICPP
1994
IEEE
15 years 3 months ago
1994
IEEE
111
click to vote
WWW
2011
ACM
14 years 6 months ago
2011
ACM
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
83
Voted
AAAI
2000
15 years 12 days ago
2000
In this paper, we present PQSOLVE, a distributed theorem-prover for Quantified Boolean Formulae. First, we introduce our sequential algorithm QSOLVE, which uses new heuristics and...
81
Voted
AAAI
2010
15 years 15 days 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...
168
Voted
CP
2009
Springer
15 years 11 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...