Sciweavers

6506 search results - page 908 / 1302
» Algorithmic models for sensor networks
Sort
View
JSAC
2008
140views more  JSAC 2008»
15 years 4 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
TSP
2010
14 years 11 months ago
On scalable distributed coding of correlated sources
Abstract--This paper considers the problem of scalable distributed coding of correlated sources that are communicated to a central unit, a setting typically encountered in sensor n...
Ankur Saxena, Kenneth Rose
DSRT
2004
IEEE
15 years 8 months ago
Exploring the Spatial Density of Strategy Models in a Realistic Distributed Interactive Application
As Distributed Interactive Applications (DIAs) become increasingly more prominent in the video game industry they must scale to accommodate progressively more users and maintain a...
Damien Marshall, Declan Delaney, Séamus McL...
ECML
2003
Springer
15 years 9 months ago
Could Active Perception Aid Navigation of Partially Observable Grid Worlds?
Due to the unavoidable fact that a robot’s sensors will be limited in some manner, it is entirely possible that it can find itself unable to distinguish between differing state...
Paul A. Crook, Gillian Hayes
IROS
2007
IEEE
189views Robotics» more  IROS 2007»
15 years 10 months ago
Differential evolution approach to the grid-based localization and mapping problem
— A new solution to the Simultaneous Localization and Modelling problem is presented. It is based on the stochastic search of solutions in the state space to the global localizat...
Luis Moreno, Santiago Garrido, Fernando Martin, Ma...