Sciweavers

155 search results - page 14 / 31
» Formal Theory of Noisy Sensor Network Localization
Sort
View
NIPS
1992
13 years 8 months ago
Some Solutions to the Missing Feature Problem in Vision
In visual processing the ability to deal with missing and noisy information is crucial. Occlusions and unreliable feature detectors often lead to situations where little or no dir...
Subutai Ahmad, Volker Tresp
HYBRID
2007
Springer
13 years 11 months ago
Solving Coverage Problems with Embedded Graph Grammars
We show how Embedded Graph Grammars (EGGs) are used to specify local interaction rules between mobile robots in a natural manner. This formalism allows us to treat local network to...
John-Michael McNew, Eric Klavins, Magnus Egerstedt
IPSN
2007
Springer
14 years 1 months ago
Power scheduling for wireless sensor and actuator networks
We previously presented a model for some wireless sensor and actuator network (WSAN) applications based on the vector space tools of frame theory. In this WSAN model there is a we...
Christopher J. Rozell, Don H. Johnson
JSAC
2008
140views more  JSAC 2008»
13 years 7 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
GECCO
2008
Springer
146views Optimization» more  GECCO 2008»
13 years 8 months ago
A formal performance modeling framework for bio-inspired ad hoc routing protocols
Bio-inspired ad hoc routing is an active area of research. The designers of these algorithms predominantly evaluate the performance of their protocols with the help of simulation ...
Muhammad Saleem, Syed Ali Khayam, Muddassar Farooq