88 search results - page 13 / 18 » A Parallel Monte-Carlo Tree Search Algorithm |
119
Voted
CCO
2001
Springer
15 years 5 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...
128
Voted
SOFSEM
2000
Springer
15 years 4 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
125
Voted
IPPS
2007
IEEE
15 years 7 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...
121
Voted
ICDCSW
2003
IEEE
15 years 6 months ago
2003
IEEE
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...
136
Voted
MSO
2003
15 years 2 months ago
2003
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...