17 search results - page 3 / 4 » Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-... |
CACM
2010
13 years 6 months ago
2010
We introduce and analyze a natural algorithm for multi-venue exploration from censored data, which is motivated by the Dark Pool Problem of modern quantitative finance. We prove t...
SODA
2001
ACM
13 years 7 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
INFOCOM
2007
IEEE
14 years 13 days ago
2007
IEEE
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
ALDT
2009
Springer
14 years 23 days ago
2009
Springer
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
AAAI
1996
13 years 7 months ago
1996
We formalize a model for supervised learning of action strategies in dynamic stochastic domains and show that PAC-learning results on Occam algorithms hold in this model as well. W...