Sciweavers

675 search results - page 45 / 135
» Online stochastic optimization under time constraints
Sort
View
SIAMCO
2010
93views more  SIAMCO 2010»
13 years 8 months ago
Dynamic Vehicle Routing with Priority Classes of Stochastic Demands
In this paper we introduce a dynamic vehicle routing problem in which there are multiple vehicles and multiple priority classes of service demands. Service demands of each priority...
Stephen L. Smith, Marco Pavone, Francesco Bullo, E...
ECCC
2007
180views more  ECCC 2007»
13 years 10 months ago
Adaptive Algorithms for Online Decision Problems
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
Elad Hazan, C. Seshadhri
SODA
2012
ACM
229views Algorithms» more  SODA 2012»
12 years 11 days ago
Approximation algorithms for stochastic orienteering
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath ...
ICCAD
2002
IEEE
149views Hardware» more  ICCAD 2002»
14 years 6 months ago
Battery-aware power management based on Markovian decision processes
- This paper addresses the problem of maximizing capacity utilization of the battery power source in a portable electronic system under latency and loss rate constraints. First, a ...
Peng Rong, Massoud Pedram
STACS
1999
Springer
14 years 2 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann