Sciweavers

1566 search results - page 197 / 314
» On a Cone Covering Problem
Sort
View
LCN
2005
IEEE
15 years 10 months ago
Approximate Coverage in Wireless Sensor Networks
— Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention ...
Yuzhen Liu, Weifa Liang
PODC
2005
ACM
15 years 10 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
130
Voted
SIGCSE
2004
ACM
132views Education» more  SIGCSE 2004»
15 years 9 months ago
Using game days to teach a multiagent system class
Multiagent systems is an attractive problem solving approach that is becoming ever more feasible and popular in today’s world. It combines artificial intelligence (AI) and distr...
Leen-Kiat Soh
COLT
2003
Springer
15 years 9 months ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
AINA
2010
IEEE
15 years 9 months ago
Mobile Element Path Planning for Time-Constrained Data Gathering in Wireless Sensor Networks
— We consider the problem of gathering data from a sensor network using mobile elements. In particular, we consider the case where the data are produced by measurements and need ...
Khaled Almiani, Anastasios Viglas, Lavy Libman