Sciweavers

126 search results - page 18 / 26
» Optimal Routing in the Worst-Case-Error Metric
Sort
View
JCM
2010
126views more  JCM 2010»
13 years 6 months ago
Adding Redundancy to Replication in Window-aware Delay-tolerant Routing
— This paper presents a resource-efficient protocol for opportunistic routing in delay-tolerant networks (DTN). First, our approach exploits the context of mobile nodes (speed, ...
Gabriel Sandulescu, Simin Nadjm-Tehrani
ROBOCOMM
2007
IEEE
14 years 2 months ago
Decentralized vehicle routing in a stochastic and dynamic environment with customer impatience
— Consider the following scenario: a spatio-temporal stochastic process generates service requests, localized at points in a bounded region on the plane; these service requests a...
Marco Pavone, Nabhendra Bisnik, Emilio Frazzoli, V...
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 1 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
ECCC
2007
180views more  ECCC 2007»
13 years 8 months ago
Adaptive Algorithms for Online Decision Problems
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
Elad Hazan, C. Seshadhri
SLIP
2006
ACM
14 years 2 months ago
A tale of two nets: studies of wirelength progression in physical design
At every stage in physical design, engineers are faced with many different objectives and tools to develop, optimize, and evaluate their design. Each choice of a tool or an objec...
Andrew B. Kahng, Sherief Reda