112 search results - page 14 / 23 » Searching Game Trees in Parallel Using SSS |
150
Voted
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
121
Voted
SC
1995
ACM
15 years 6 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...
119
click to vote
ACG
2006
Springer
15 years 8 months ago
2006
Springer
A method to simulate the physics of the game of pool is presented. The method is based upon a parametrization of ball motion which allows the time of occurrence of events, such as...
148
click to vote
IPPS
2010
IEEE
15 years 14 days ago
2010
IEEE
Automatic tuning has emerged as a solution to provide high-performance libraries for fast changing, increasingly complex computer architectures. We distinguish offline adaptation (...
103
click to vote
IJCAI
1997
15 years 3 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 ...