6105 search results - page 284 / 1221 » A Parallel Algorithm for Bound-Smoothing |
155
click to vote
DNA
2004
Springer
16 years 2 days ago
2004
Springer
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...
164
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper, we discuss a parallel tabu search algorithm with implementation in a heterogeneous environment. Two parallelization strategies are integrated: functional decomposit...
179
click to vote
ANTSW
2006
Springer
15 years 10 months ago
2006
Springer
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions f...
162
click to vote
PDPTA
2003
15 years 8 months ago
2003
We present a novel approach to parallel Boolean satisfiability (SAT) checking. A distinctive feature of our parallel SAT checker is that it incorporates all essential heuristics ...
185
click to vote
PDP
2007
IEEE
16 years 28 days ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...