674 search results - page 27 / 135 » The computational complexity of the parallel knock-out probl... |
128
click to vote
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
Computational biology research is now faced with the burgeoning number of genome data. The rigorous postprocessing of this data requires an increased role for high performance com...
IPPS
1996
IEEE
15 years 5 months ago
1996
IEEE
In this paper, we present a parallel algorithm for the minimization of deterministic finite state automata (DFA's) and discuss its implementation on a connection machine CM-5...
IPPS
2008
IEEE
15 years 7 months ago
2008
IEEE
Many of the optimization problems from the real world are multiobjective in nature, and the reference algorithm for multiobjective optimization is NSGA-II. Frequently, these probl...
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
120
click to vote
SPAA
1993
ACM
15 years 5 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...