4759 search results - page 291 / 952 » Parallelizing the Phylogeny Problem |
170
click to vote
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving...
201
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
199
click to vote
HIPC
2000
Springer
15 years 10 months ago
2000
Springer
Heterogeneous computing environments have become attractive platforms to schedule computationally intensive jobs. We consider the problem of mapping independent tasks onto machines...
151
click to vote
PPSN
2000
Springer
15 years 10 months ago
2000
Springer
A family of recombination operators is studied in this work. These operators are based on keeping and using certain information about the past evolution of the algorithm to guide t...
179
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...