Sciweavers

4037 search results - page 189 / 808
» Routing without ordering
Sort
View
ANOR
2005
120views more  ANOR 2005»
13 years 10 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello
WIOPT
2010
IEEE
13 years 8 months ago
Analysis and design of message ferry routes in sensor networks using polling models
—We consider a Ferry based Wireless Local Area Network (FWLAN), in which information is forwarded from a base station to sensors, or gathered from sensors to a base station using...
Veeraruna Kavitha, Eitan Altman
GLOBECOM
2010
IEEE
13 years 8 months ago
Routing in Hybrid Mesh Networks of Cognitive and IEEE 802.11 Radios
Abstract--Cognitive radios (CRs) are devices that access spectrum opportunistically taking advantage of unused portions of licensed spectrum. Therefore, depending on the licensed r...
Marcel William Rocha da Silva, José Ferreir...
MOBICOM
2003
ACM
14 years 3 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
SPAA
2003
ACM
14 years 3 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman