Sciweavers

4759 search results - page 266 / 952
» Parallelizing the Phylogeny Problem
Sort
View
101
Voted
JAVA
2000
Springer
15 years 6 months ago
A Java fork/join framework
This paper describes the design, implementation, and performance of a Java framework for supporting a style of parallel programming in which problems are solved by (recursively) s...
Doug Lea
136
Voted
SIAMCOMP
1998
137views more  SIAMCOMP 1998»
15 years 2 months ago
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
Sridhar Rajagopalan, Vijay V. Vazirani
106
Voted
EUROPAR
2007
Springer
15 years 8 months ago
Locality Optimized Shared-Memory Implementations of Iterated Runge-Kutta Methods
Iterated Runge-Kutta (IRK) methods are a class of explicit solution methods for initial value problems of ordinary differential equations (ODEs) which possess a considerable poten...
Matthias Korch, Thomas Rauber
95
Voted
PPSN
2004
Springer
15 years 8 months ago
On the Importance of Information Speed in Structured Populations
A radius–based separation of selection and recombination spheres in diffusion model EAs is introduced, enabling a new taxonomy, oriented towards information flow analysis. It a...
Mike Preuss, Christian Lasarczyk
ATVA
2008
Springer
148views Hardware» more  ATVA 2008»
15 years 4 months ago
Decidable Compositions of O-Minimal Automata
We identify a new class of decidable hybrid automata: namely, parallel compositions of semi-algebraic o-minimal automata. The class we consider is fundamental to hierarchical model...
Alberto Casagrande, Pietro Corvaja, Carla Piazza, ...