Sciweavers

1016 search results - page 121 / 204
» Optimized algorithms for multi-agent routing
Sort
View
SECON
2007
IEEE
15 years 4 months ago
Approximation Algorithm for Base Station Placement in Wireless Sensor Networks
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...
Yi Shi, Yiwei Thomas Hou
COR
2007
112views more  COR 2007»
14 years 9 months ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...
ISPD
2003
ACM
103views Hardware» more  ISPD 2003»
15 years 3 months ago
An integrated floorplanning with an efficient buffer planning algorithm
Previous works on buffer planning are mainly based on fixed die placement. It is necessary to reduce the complexity of computing the feasible buffer insertion sites to integrate t...
Yuchun Ma, Xianlong Hong, Sheqin Dong, Song Chen, ...
CORR
2010
Springer
178views Education» more  CORR 2010»
14 years 7 months ago
Adaptive Algorithms for Coverage Control and Space Partitioning in Mobile Robotic Networks
We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends ...
Jerome Le Ny, George J. Pappas
GLOBECOM
2007
IEEE
15 years 4 months ago
A Steepest Descent Relocation Algorithm for Placement of Sinks in a Sensor Network
— In this paper we use an information flow model for placement of traffic sinks in a wireless sensor network. Our mathematical model translates a communication network composed...
Mehdi Kalantari, Mark A. Shayman