146 search results - page 25 / 30 » Parallel Monte-Carlo Tree Search |
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Software transactional memory systems enable a programmer to easily write concurrent data structures such as lists, trees, hashtables, and graphs, where non-conflicting operation...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper examines MPI’s ability to support continuous, dynamic load balancing for unbalanced parallel applications. We use an unbalanced tree search benchmark (UTS) to compare...
111
click to vote
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
143
click to vote
PPOPP
2003
ACM
15 years 4 months ago
2003
ACM
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...
100
click to vote
COMCOM
2004
14 years 11 months ago
2004
In this paper, we propose QROUTE, an integrated framework for QoS-guaranteed multicast routing, in which a feasible multicast tree meeting multiple QoS constraints can be construc...