2314 search results - page 427 / 463 » Minimal Partitions of a Graph |
69
Voted
DATE
1997
IEEE
15 years 5 months ago
1997
IEEE
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
94
Voted
ECP
1997
Springer
15 years 5 months ago
1997
Springer
It is traditional wisdom that one should start from the goals when generating a plan in order to focus the plan generation process on potentially relevant actions. The graphplan sy...
102
click to vote
STACS
1997
Springer
15 years 5 months ago
1997
Springer
Exotic semirings such as the “(max, +) semiring” (R ∪ {−∞}, max, +), or the “tropical semiring” (N ∪ {+∞}, min, +), have been invented and reinvented many times s...
145
click to vote
FSTTCS
1993
Springer
15 years 4 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
87
Voted
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...