2183 search results - page 413 / 437 » Generating Parallel Algorithms for Cluster and Grid Computin... |
104
click to vote
PACT
2005
Springer
15 years 3 months ago
2005
Springer
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
104
click to vote
BMCBI
2011
14 years 1 months ago
2011
Background: Over the past few years, new massively parallel DNA sequencing technologies have emerged. These platforms generate massive amounts of data per run, greatly reducing th...
100
click to vote
COCO
2005
Springer
15 years 3 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
104
click to vote
SMILE
1998
Springer
15 years 1 months ago
1998
Springer
As virtual worlds demand ever more realistic 3D models, attention is being focussed on systems that can acquire graphical models from real objects. This paper describes a system wh...
108
click to vote
JSSPP
2004
Springer
15 years 3 months ago
2004
Springer
The self-tuning dynP scheduler for modern cluster resource management systems switches between different basic scheduling policies dynamically during run time. This allows to reac...