Sciweavers

315 search results - page 28 / 63
» Shortest path optimization under limited information
Sort
View
EOR
2010
159views more  EOR 2010»
13 years 2 months ago
An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...
Nabila Azi, Michel Gendreau, Jean-Yves Potvin
MOBIHOC
2004
ACM
14 years 7 months ago
Using labeled paths for loop-free on-demand routing in ad hoc networks
We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree in...
Hari Rangarajan, J. J. Garcia-Luna-Aceves
ICASSP
2008
IEEE
14 years 2 months ago
Cryptographic measures in information hiding
Recent information hiding schemes are scrutinized in terms of their cryptographic performance. We establish conditions under which the key equivocation function is optimal for the...
Phillip A. Regalia
MOBICOM
2003
ACM
14 years 1 months ago
Towards realistic mobility models for mobile ad hoc networks
One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number...
Amit P. Jardosh, Elizabeth M. Belding-Royer, Kevin...
SAS
2000
Springer
149views Formal Methods» more  SAS 2000»
13 years 11 months ago
FULLDOC: A Full Reporting Debugger for Optimized Code
As compilers increasingly rely on optimizations to achieve high performance, the effectiveness of source level debuggers for optimized code continues to falter. Even if values of s...
Clara Jaramillo, Rajiv Gupta, Mary Lou Soffa