2313 search results - page 39 / 463 » On Heuristic Time Hierarchies |
182
click to vote
ISCA
2006
IEEE
15 years 6 months ago
2006
IEEE
The assumption of maximum parallelism support for the successful realization of scalable quantum computers has led to homogeneous, "sea-of-qubits" architectures. The res...
153
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
135
click to vote
IPL
2002
15 years 5 months ago
2002
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
147
click to vote
HPCA
2001
IEEE
16 years 6 months ago
2001
IEEE
In this papel; we address the severe performance gap caused by high processor clock rates and slow DRAM accesses. We show that even with an aggressive, next-generation memory syst...
141
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Profile hidden Markov models (profile-HMMs) are sensitive tools for remote protein homology detection, but the main scoring algorithms, Viterbi or Forward, require con...