Sciweavers

151 search results - page 11 / 31
» Minimizing Movement in Mobile Facility Location Problems
Sort
View
74
Voted
INFOCOM
1998
IEEE
15 years 1 months ago
Demand-based Radio Network Planning of Cellular Mobile Communication Systems
: This paper presents a demand-based engineering method for designing radio networks of cellularmobile communicationsystems. The proposed procedure is based on a forward-engineerin...
Kurt Tutschku
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
15 years 1 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
JSAC
2010
120views more  JSAC 2010»
14 years 4 months ago
Simple movement control algorithm for bi-connectivity in robotic sensor networks
Robotic sensor networks are more powerful than sensor networks because the sensors can be moved by the robots to adjust their sensing coverage. In robotic sensor networks, an impor...
Hai Liu, Xiaowen Chu, Yiu-Wing Leung, Rui Du
JSAC
2010
122views more  JSAC 2010»
14 years 7 months ago
Scalable service migration in autonomic network environments
Abstract— Service placement is a key problem in communication networks as it determines how efficiently the user service demands are supported. This problem has been traditional...
Konstantinos Oikonomou, Ioannis Stavrakakis
SAINT
2005
IEEE
15 years 3 months ago
Design and Evaluation of a Location-Based Virtual City System for Mobile Phones
We are developing a virtual city system with a model that consists of virtual architectural objects and virtual creatures, geographically overlaid onto the real world. People who ...
Hiroyuki Tarumi, Seiko Tokuda, Tomohiro Yasui, Kaz...