Sciweavers

2348 search results - page 69 / 470
» Stochastic Mapping Frameworks
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
14 years 8 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
ICRA
2003
IEEE
167views Robotics» more  ICRA 2003»
15 years 3 months ago
Local exploration: online algorithms and a probabilistic framework
— Mapping an environment with an imaging sensor becomes very challenging if the environment to be mapped is unknown and has to be explored. Exploration involves the planning of v...
Volkan Isler, Sampath Kannan, Kostas Daniilidis
GLOBECOM
2007
IEEE
15 years 4 months ago
A New Stochastic Admission Control Scheme for Wireless Networks
— In traditional call admission control (CAC) schemes, mobile users are always the passive roles during the admission procedures and the base station determines whether to admit o...
Xinbing Wang, Chen Zhuo, Youyun Xu, Ruhai Wang
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 3 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
WICON
2008
14 years 11 months ago
Optimal stochastic routing in low duty-cycled wireless sensor networks
We study a routing problem in wireless sensor networks where sensors are duty-cycled. When sensors alternate between on and off modes, delay encountered in packet delivery due to ...
Dongsook Kim, Mingyan Liu