Sciweavers

2862 search results - page 196 / 573
» Bicriteria Network Design Problems
Sort
View
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 3 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
WS
2006
ACM
15 years 5 months ago
Location privacy in wireless personal area networks
Location privacy is one of the major security problems in a Wireless Personal Area Network (WPAN). By eavesdropping on the transmitted packets, an attacker can keep track of the p...
Dave Singelée, Bart Preneel
INFOCOM
2005
IEEE
15 years 4 months ago
On static reachability analysis of IP networks
The primary purpose of a network is to provide reachability between applications running on end hosts. In this paper, we describe how to compute the reachability a network provide...
Geoffrey G. Xie, Jibin Zhan, David A. Maltz, Hui Z...
PERCOM
2007
ACM
15 years 10 months ago
Static Path Planning for Mobile Beacons to Localize Sensor Networks
In this paper, we study the static path planning problem with wireless sensor network localization as the primary objective. We consider a model in which sensors are assumed to be...
Rui Huang, Gergely V. Záruba
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
15 years 5 months ago
Stability in the self-organized evolution of networks
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
Thomas Jansen, Madeleine Theile