Sciweavers

1532 search results - page 277 / 307
» A Comparison of RESTART Implementations
Sort
View
ESA
2005
Springer
123views Algorithms» more  ESA 2005»
15 years 3 months ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
15 years 3 months ago
A hardware pipeline for function optimization using genetic algorithms
Genetic Algorithms (GAs) are very commonly used as function optimizers, basically due to their search capability. A number of different serial and parallel versions of GA exist. ...
Malay Kumar Pakhira, Rajat K. De
HPCC
2005
Springer
15 years 3 months ago
Reducing Memory Sharing Overheads in Distributed JVMs
Distributed JVM systems enable concurrent Java applications to transparently run on clusters of commodity computers by supporting Java’s shared-memory model over multiple JVMs di...
Marcelo Lobosco, Orlando Loques, Claudio Luis de A...
LOPSTR
2005
Springer
15 years 3 months ago
Experiments in Context-Sensitive Analysis of Modular Programs
Abstract. Several models for context-sensitive analysis of modular programs have been proposed, each with different characteristics and representing different trade-offs. The ad...
Jesús Correas, Germán Puebla, Manuel...
SAT
2005
Springer
129views Hardware» more  SAT 2005»
15 years 3 months ago
On Finding All Minimally Unsatisfiable Subformulas
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
Mark H. Liffiton, Karem A. Sakallah