13 search results - page 2 / 3 » Online Optimization Under Adversarial Perturbations |
SPAA
2003
ACM
13 years 10 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
AUTOMATICA
1999
13 years 5 months ago
1999
We develop and analyze an algorithm to maximize the throughput of a serial kanbanbased manufacturing system with arbitrary arrival and service process distributions by adjusting t...
SIGECOM
2010
ACM
13 years 10 months ago
2010
ACM
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
SOFSEM
2010
Springer
14 years 2 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
MST
2000
13 years 5 months ago
2000
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...