Sciweavers

1016 search results - page 99 / 204
» Optimized algorithms for multi-agent routing
Sort
View
PIMRC
2010
IEEE
14 years 7 months ago
Self-optimizing routing in MANETs with multi-class flows
In this paper we show how game theory and Gibbs sampling techniques can be used to design a self-optimizing algorithm for minimizing end-to-end delays for all flows in a multi-clas...
Pierre Coucheney, Bruno Gaujal, Corinne Touati
AISS
2010
161views more  AISS 2010»
14 years 7 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
ESA
2011
Springer
257views Algorithms» more  ESA 2011»
13 years 9 months ago
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks
We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocol...
Josep Díaz, Alberto Marchetti-Spaccamela, D...
ANOR
2010
112views more  ANOR 2010»
14 years 8 months ago
Online stochastic optimization under time constraints
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Pascal Van Hentenryck, Russell Bent, Eli Upfal
NAS
2009
IEEE
15 years 4 months ago
Reliable Lightpath Routing in Optical Mesh Networks under Multiple Link Failures
- In this work, we study the problem of maximizing lightpath reliability in optical mesh networks against simultaneous failures of multiple fiber links without using protection sch...
Shengli Yuan