Sciweavers

319 search results - page 40 / 64
» Context-Aware Route Planning
Sort
View
159
Voted
SOICT
2010
14 years 7 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
109
Voted
SLS
2009
Springer
224views Algorithms» more  SLS 2009»
15 years 7 months ago
High-Performance Local Search for Solving Real-Life Inventory Routing Problems
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
Thierry Benoist, Bertrand Estellon, Fréd&ea...
113
Voted
BROADNETS
2007
IEEE
15 years 6 months ago
Resource dimensioning in WDM networks under state-based routing schemes
— Network dimensioning for wavelength-routed WDM networks has been extensively studied to maximize connection acceptance rate while minimizing the total cost. However, Internet s...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
TON
2010
210views more  TON 2010»
14 years 7 months ago
A New Approach to Optical Networks Security: Attack-Aware Routing and Wavelength Assignment
Abstract-- Security issues and attack management in transparent WDM (Wavelength Division Multiplexing) optical networks has become of prime importance to network operators due to t...
Nina Skorin-Kapov, J. Chen, Lena Wosinska
78
Voted
ICRA
2005
IEEE
126views Robotics» more  ICRA 2005»
15 years 6 months ago
A Coverage Algorithm for Multi-robot Boundary Inspection
— This paper introduces the multi-robot boundary coverage problem, wherein a group of k robots must inspect every point on the boundary of a 2-dimensional test environment. Using...
Kjerstin Easton, Joel Burdick