Sciweavers

1082 search results - page 153 / 217
» Approximation Algorithms for Spreading Points
Sort
View
KI
2007
Springer
13 years 9 months ago
Solving Decentralized Continuous Markov Decision Problems with Structured Reward
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...
Emmanuel Benazera
ICNP
2009
IEEE
13 years 6 months ago
Achieving Efficiency and Fairness for Association Control in Vehicular Networks
Deploying city-wide 802.11 access points has made possible internet access in a vehicle, nevertheless it is challenging to maintain client performance at vehicular speed especially...
Lei Xie, Qun Li, Weizhen Mao, Jie Wu, Daoxu Chen
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
14 years 2 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
CCCG
2007
13 years 10 months ago
Generalized Watchman Route Problem with Discrete View Cost
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 10 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...