144 search results - page 1 / 29 » Stochastic analyses for online combinatorial optimization pr... |
SODA
2008
ACM
13 years 5 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
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...
AAAI
2008
13 years 6 months ago
2008
We present the design of a banner advertising auction which is considerably more expressive than current designs. We describe a general model of expressive ad contracts/bidding an...
SAGA
2005
Springer
13 years 9 months ago
2005
Springer
Two general-purpose metaheuristic algorithms for solving multiobjective stochastic combinatorial optimization problems are introduced: SP-ACO (based on the Ant Colony Optimization ...
SIGECOM
2004
ACM
13 years 9 months ago
2004
ACM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...