Sciweavers

1760 search results - page 140 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
ICASSP
2010
IEEE
13 years 8 months ago
Guaranteed robust distributed estimation in a network of sensors
This paper proposes a guaranteed robust bounded-error distributed estimation algorithm. It may be employed to perform parameter estimation from data collected in a network of wire...
Jean-Benoist Leger, Michel Kieffer
CN
2006
75views more  CN 2006»
13 years 8 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon
FSR
2003
Springer
251views Robotics» more  FSR 2003»
14 years 1 months ago
Distributed Search and Rescue with Robot and Sensor Teams
We develop a network of distributed mobile sensor systems as a solution to the emergency response problem. The mobile sensors are inside a building and they form a connected ad-ho...
George Kantor, Sanjiv Singh, Ronald A. Peterson, D...
COCOA
2008
Springer
13 years 10 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
BROADNETS
2006
IEEE
14 years 2 months ago
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
Reuven Cohen, Niloofar Fazlollahi, David Starobins...