Sciweavers

1692 search results - page 140 / 339
» A Dynamic Network Interdiction Problem
Sort
View
114
Voted
ICDCSW
2008
IEEE
15 years 10 months ago
Mobility Control for Complete Coverage in Wireless Sensor Networks
In this paper, we propose a new control method to cover the “holes” in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are d...
Zhen Jiang, Jie Wu, Robert Kline, Jennifer Krantz
PERVASIVE
2005
Springer
15 years 9 months ago
Parasitic Mobility for Pervasive Sensor Networks
Distributed sensor networks offer many new capabilities for contextually monitoring environments. By making such systems mobile, we increase the application-space for the distribut...
Mathew Laibowitz, Joseph A. Paradiso
ASC
2004
15 years 3 months ago
Adaptive reconfiguration of data networks using genetic algorithms
Genetic algorithms are applied to an important, but little-investigated, network design problem, that of reconfiguring the topology and link capacities of an operational network t...
David J. Montana, Talib S. Hussain
123
Voted
GLOBECOM
2006
IEEE
15 years 10 months ago
Optimal Routing Between Alternate Paths With Different Network Transit Delays
— We consider the path-determination problem in Internet core routers that distribute flows across alternate paths leading to the same destination. We assume that the remainder ...
Essia Hamouda Elhafsi, Mart Molle
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
15 years 8 months ago
Lagrangian Relaxation Neural Networks for Job Shop Scheduling
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
Peter B. Luh, Xing Zhao, Yajun Wang