144 search results - page 8 / 29 » Stochastic analyses for online combinatorial optimization pr... |
WWW
2008
ACM
15 years 10 months ago
2008
ACM
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
CPM
1999
Springer
15 years 1 months ago
1999
Springer
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
CPAIOR
2006
Springer
15 years 1 months ago
2006
Springer
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...
144
click to vote
ICAART
2010
INSTICC
15 years 6 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
114
click to vote
CCE
2008
14 years 9 months ago
2008
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...