146 search results - page 22 / 30 » Parallel Monte-Carlo Tree Search |
GCC
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Search is until now a difficult problem in peer-to-peer (P2P) filesharing systems. In this paper, we propose to use adaptive metadata spreading to make search in P2P netw...
111
Voted
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
IPPS
1998
IEEE
15 years 3 months ago
1998
IEEE
Multi-dimensional index structures such as R-trees enable fast searching in high-dimensional spaces. They differ from uni-dimensional structures in the following aspects: (1) inde...
100
click to vote
CCO
2001
Springer
15 years 4 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
71
Voted
FPL
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. With the help of the FPGA technology, the boarder between hardand software has vanished. It is now possible to develop complex designs and fine grained parallel applicat...