146 search results - page 18 / 30 » Parallel Monte-Carlo Tree Search |
113
Voted
ICCS
2004
Springer
15 years 9 months ago
2004
Springer
To improve popular services discovery mechanism (UDDI mainly), we propose an agent-based services discovery mechanism. In this mechanism, services information is stored in distribu...
133
Voted
SC
1995
ACM
15 years 7 months ago
1995
ACM
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...
143
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
131
Voted
ICPP
2008
IEEE
15 years 10 months ago
2008
IEEE
An asynchronous work-stealing implementation of dynamic load balance is implemented using Unified Parallel C (UPC) and evaluated using the Unbalanced Tree Search (UTS) benchmark ...
113
Voted
IJCAI
1997
15 years 5 months ago
1997
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...