674 search results - page 56 / 135 » The computational complexity of the parallel knock-out probl... |
119
click to vote
ICCS
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
138
click to vote
IPPS
2010
IEEE
14 years 11 months 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 (...
128
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
Many large-scale clusters now have hundreds of thousands of processors, and processor counts will be over one million within a few years. Computational scientists must scale their ...
118
click to vote
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
131
click to vote
PPSN
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...