14548 search results - page 382 / 2910 » The Optimal Path-Matching Problem |
180
click to vote
SWAT
2004
Springer
16 years 2 days ago
2004
Springer
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
169
click to vote
CCE
2005
15 years 6 months ago
2005
Optimal control problems in batch distillation involve finding a trajectory for the reflux ratio so as to maximize a performance index. Then the controller is asked to follow this...
174
click to vote
AI
1998
Springer
15 years 6 months ago
1998
Springer
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
163
click to vote
ATMOS
2010
15 years 5 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
198
click to vote
ESA
1998
Springer
15 years 11 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...