4565 search results - page 496 / 913 » Time Optimal Self-Stabilizing Algorithms |
152
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
140
click to vote
CCE
2004
15 years 4 months ago
2004
The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and...
148
click to vote
ORL
2000
15 years 3 months ago
2000
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
117
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
167
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...