Sciweavers

5214 search results - page 83 / 1043
» The Online Specialization Problem
Sort
View
CPAIOR
2006
Springer
13 years 11 months ago
Online Stochastic Reservation Systems
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...
Pascal Van Hentenryck, Russell Bent, Yannis Vergad...
IPL
2010
93views more  IPL 2010»
13 years 6 months ago
Randomized algorithms for online bounded bidding
In the online bidding problem, a bidder is trying to guess a positive number T, by placing bids until the value of the bid is at least T. The bidder is charged with the sum of the...
Leah Epstein, Asaf Levin
FOCS
2005
IEEE
14 years 1 months ago
AdWords and Generalized On-line Matching
How does a search engine company decide what ads to display with each query so as to maximize its revenue? This turns out to be a generalization of the online bipartite matching p...
Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vij...
ICRA
2002
IEEE
121views Robotics» more  ICRA 2002»
14 years 20 days ago
A Tale of Two Filters - On-Line Novelty Detection
Abstract— For mobile robots, as well as other learning systems, the ability to highlight unexpected features of their environment – novelty detection – is very useful. One pa...
Paul A. Crook, Stephen Marsland, Gillian Hayes, Ul...
CVPR
2007
IEEE
14 years 9 months ago
Online Spatial-temporal Data Fusion for Robust Adaptive Tracking
One problem with the adaptive tracking is that the data that are used to train the new target model often contain errors and these errors will affect the quality of the new target...
Jixu Chen, Qiang Ji