Sciweavers

307 search results - page 14 / 62
» Subjective-Cost Policy Routing
Sort
View
JCO
2006
106views more  JCO 2006»
13 years 7 months ago
Reliable Ad Hoc Routing Based on Mobility Prediction
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...
Jian Tang, Guoliang Xue, Weiyi Zhang
INFOCOM
1995
IEEE
13 years 11 months ago
Complexity of Gradient Projection Method for Optimal Routing in Data Networks
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
Wei Kang Tsai, John K. Antonio, Garng M. Huang
ISI
2006
Springer
13 years 7 months ago
Towards Optimal Police Patrol Routes with Genetic Algorithms
It is quite consensual that police patrolling can be regarded as one of the best well-known practices for implementing public-safety preventive policies towards the combat of an as...
Danilo Reis, Adriano Melo, André L. V. Coel...
SIAMCO
2010
93views more  SIAMCO 2010»
13 years 6 months ago
Dynamic Vehicle Routing with Priority Classes of Stochastic Demands
In this paper we introduce a dynamic vehicle routing problem in which there are multiple vehicles and multiple priority classes of service demands. Service demands of each priority...
Stephen L. Smith, Marco Pavone, Francesco Bullo, E...
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
13 years 5 months ago
Optimal control in two-hop relay routing
We study the optimal control of propagation of packets in delay tolerant mobile ad-hoc networks. We consider a two-hop forwarding policy under which the expected number of nodes ca...
Eitan Altman, Tamer Basar, Francesco De Pellegrini