146 search results - page 13 / 30 » Parallel Monte-Carlo Tree Search |
136
click to vote
JCB
2008
14 years 11 months ago
2008
We present BayesMD, a Bayesian Motif Discovery model with several new features. Three different types of biological a priori knowledge are built into the framework in a modular fa...
AAAI
2010
15 years 1 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...
177
click to vote
CP
2009
Springer
16 years 10 days 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 ...
ICMCS
2006
IEEE
15 years 5 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...
IPPS
1997
IEEE
15 years 3 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...