4759 search results - page 264 / 952 » Parallelizing the Phylogeny Problem |
121
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...
156
Voted
TACAS
2010
Springer
15 years 9 months ago
2010
Springer
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
105
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
The design of algorithms that can run unchanged yet efficiently on a variety of machines characterized by different degrees of parallelism and communication capabilities is a hig...
96
Voted
ATVA
2005
Springer
15 years 8 months ago
2005
Springer
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. A naive parallelization of such algorithms ...
109
Voted
IPPS
1996
IEEE
15 years 6 months ago
1996
IEEE
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...