Sciweavers

4565 search results - page 21 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
TRANSCI
2010
169views more  TRANSCI 2010»
13 years 3 months ago
A Model and Algorithm for the Courier Delivery Problem with Uncertainty
We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncert...
Ilgaz Sungur, Yingtao Ren, Fernando Ordó&nt...
RTSS
2002
IEEE
14 years 1 months ago
Scheduling Tasks with Mixed Preemption Relations for Robustness to Timing Faults
abstractions + algorithms For Robustness to Timing Faults A new optimality criterion + algorithms
John Regehr
COLT
2005
Springer
14 years 2 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
PC
2011
314views Management» more  PC 2011»
13 years 3 months ago
Restart strategies in optimization: parallel and serial cases
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the exist...
Oleg V. Shylo, Timothy Middelkoop, Panos M. Pardal...
FOCS
1995
IEEE
14 years 11 days ago
Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)
d Abstract) Noga Alon ∗ Jeff Edmonds † Michael Luby ‡ An (n, c, , r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. ...
Noga Alon, Jeff Edmonds, Michael Luby