21 search results - page 3 / 5 » Scalability and Parallelization of Monte-Carlo Tree Search |
PVLDB
2010
13 years 2 months ago
2010
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
ISCC
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
19
Voted
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
SC
2009
ACM
14 years 2 months ago
2009
ACM
Irregular and dynamic parallel applications pose significant challenges to achieving scalable performance on large-scale multicore clusters. These applications often require ongo...
TVCG
2011
13 years 2 months ago
2011
We present two novel algorithms for constructing spatial hierarchies on GPUs. The first is for kd-trees that automatically balances between the level of parallelism and total mem...