Sciweavers

11910 search results - page 190 / 2382
» Online Learning Algorithms
Sort
View
116
Voted
JACM
2006
134views more  JACM 2006»
15 years 23 days ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
108
Voted
CSMR
2005
IEEE
15 years 6 months ago
A Comparison of Online and Dynamic Impact Analysis Algorithms
Impact analysis is the process of determining the effect, or impact, of a change to a software system. Dynamic impact analysis uses data obtained from executing a program to perfo...
Ben Breech, Mike Tegtmeyer, Lori L. Pollock
96
Voted
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
15 years 4 months ago
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall
SCHEDULING
2011
14 years 7 months ago
On robust online scheduling algorithms
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobsâ€...
Michael Gatto, Peter Widmayer
125
Voted
CPAIOR
2008
Springer
15 years 2 months ago
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
Luc Mercier, Pascal Van Hentenryck