1415 search results - page 80 / 283 » Can Parallel Algorithms Enhance Serial Implementation |
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main a...
UAI
1997
15 years 3 months ago
1997
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...
123
click to vote
CPE
1998
Springer
15 years 6 months ago
1998
Springer
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
140
click to vote
EDOC
2000
IEEE
15 years 6 months ago
2000
IEEE
Due to its high protocol overhead, both in data traffic and in round-trips, Java RMI is poorly suited for communication over slow wireless links. However, its performance can be ...
104
Voted
ICPP
2000
IEEE
15 years 6 months ago
2000
IEEE
A runtime parallel incremental DAG scheduling approach is described in this paper. A DAG is expanded incrementally, scheduled, and executed on a parallel machine. A DAG scheduling...