4759 search results - page 268 / 952 » Parallelizing the Phylogeny Problem |
150
click to vote
STOC
1997
ACM
15 years 6 months ago
1997
ACM
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
SIAMAM
2008
15 years 2 months ago
2008
This article examines the classic problem of Stokes flow into a divided channel with, in contrast to previous literature, the divider barrier asymmetrically placed with respect to ...
150
click to vote
CONCUR
2009
Springer
15 years 10 days ago
2009
Springer
We introduce a new programming language called BlenX. It is strongly inspired to process calculi and it is an evolution of Betabinders. It has been specifically designed and implem...
STACS
1997
Springer
15 years 6 months ago
1997
Springer
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best kn...
PPSN
2004
Springer
15 years 8 months ago
2004
Springer
Considerable research effort has been spent in trying to formulate a good definition of GA-Hardness. Given an instance of a problem, the objective is to estimate the performance of...