Sciweavers

315 search results - page 14 / 63
» Shortest path optimization under limited information
Sort
View
BROADNETS
2007
IEEE
14 years 2 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
CN
2002
195views more  CN 2002»
13 years 7 months ago
A simulation study of the OSPF-OMP routing algorithm
Open shortest path first (OSPF) is the most widely used internal gateway routing protocol on the Internet. However, one shortcoming is that it does not take advantage of the exist...
G. Michael Schneider, Tamás Németh
WCNC
2010
IEEE
13 years 11 months ago
Distortion Exponents for Multi-Relay Cooperative Networks with Limited Feedback
— In this paper, we consider the transmission of a Gaussian source in a multi-relay cooperative network, where limited channel state feedback is combined with separate source and...
Jing Wang, Jie Liang, Sami Muhaidat
ANOR
2010
112views more  ANOR 2010»
13 years 6 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
CCCG
2008
13 years 9 months ago
Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
Hamid Reza Chitsaz, Steven M. LaValle, Jason M. O'...