1469 search results - page 113 / 294 » Approximate polynomial decomposition |
174
click to vote
RECOMB
2010
Springer
15 years 4 months ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
177
click to vote
COCOON
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
168
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
167
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
167
click to vote
EOR
2006
15 years 6 months ago
2006
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...