Sciweavers

91 search results - page 17 / 19
» On random points in the unit disk
Sort
View
EOR
2010
110views more  EOR 2010»
13 years 8 months ago
Pricing surplus server capacity for mean waiting time sensitive customers
Resources including various assets of supply chains, face random demand over time and can be shared by others. We consider an operational setting where a resource is shared by two...
Sudhir K. Sinha, N. Rangaraj, N. Hemachandra
ECCC
2010
80views more  ECCC 2010»
13 years 8 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...
TITS
2008
112views more  TITS 2008»
13 years 8 months ago
An Efficient Approach to Onboard Stereo Vision System Pose Estimation
Abstract--This paper presents an efficient technique for estimating the pose of an onboard stereo vision system relative to the environment's dominant surface area, which is s...
Angel Domingo Sappa, Fadi Dornaika, Daniel Ponsa, ...
STOC
2005
ACM
174views Algorithms» more  STOC 2005»
14 years 9 months ago
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera
MOBICOM
2004
ACM
14 years 2 months ago
On k-coverage in a mostly sleeping sensor network
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
Santosh Kumar, Ten-Hwang Lai, József Balogh