3016 search results - page 104 / 604 » The Online Transportation Problem |
141
Voted
WWW
2008
ACM
16 years 4 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 ...
121
click to vote
PRICAI
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. With the development of e-commerce and information access, a large amount of information can be found online, which makes a good recommendation service to be urgently nec...
136
Voted
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
131
Voted
AAAI
2007
15 years 6 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
119
Voted
COLT
2008
Springer
15 years 5 months ago
2008
Springer
Prediction from expert advice is a fundamental problem in machine learning. A major pillar of the field is the existence of learning algorithms whose average loss approaches that ...