Sciweavers

3708 search results - page 249 / 742
» Approximating Betweenness Centrality
Sort
View
IPSN
2009
Springer
16 years 1 months ago
Simultaneous placement and scheduling of sensors
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlo...
IPPS
2008
IEEE
16 years 1 months ago
Sweep coverage with mobile sensors
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
Wei-Fang Cheng, Mo Li, Kebin Liu, Yunhao Liu, Xian...
QEST
2008
IEEE
16 years 29 days ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
EVOW
2006
Springer
15 years 10 months ago
A Preliminary Study on Handling Uncertainty in Indicator-Based Multiobjective Optimization
Abstract. Real-world optimization problems are often subject to uncertainties, which can arise regarding stochastic model parameters, objective functions and decision variables. Th...
Matthieu Basseur, Eckart Zitzler
ATAL
2008
Springer
15 years 8 months ago
Adaptive multi-robot wide-area exploration and mapping
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla