Sciweavers

228 search results - page 15 / 46
» Online Routing in Triangulations
Sort
View
ASIAN
2004
Springer
109views Algorithms» more  ASIAN 2004»
14 years 2 months ago
Online Stochastic and Robust Optimization
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...
Russell Bent, Pascal Van Hentenryck
ISMAR
2006
IEEE
14 years 2 months ago
Online camera pose estimation in partially known and dynamic scenes
One of the key requirements of augmented reality systems is a robust real-time camera pose estimation. In this paper we present a robust approach, which does neither depend on ofï...
Gabriele Bleser, Harald Wuest, Didier Stricker
SODA
2008
ACM
140views Algorithms» more  SODA 2008»
13 years 10 months ago
Minimizing average latency in oblivious routing
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
Prahladh Harsha, Thomas P. Hayes, Hariharan Naraya...
PC
2007
119views Management» more  PC 2007»
13 years 8 months ago
Brokering strategies in computational grids using stochastic prediction models
In this paper we propose a new routing policy to route jobs to clusters in computational grids. This routing policy is based on index tables computed at each cluster. These tables...
Vandy Berten, Bruno Gaujal
CONEXT
2006
ACM
14 years 2 months ago
Using forgetful routing to control BGP table size
Running the Border Gateway Protocol (BGP), the Internet’s interdomain routing protocol, consumes a large amount of memory. A BGP-speaking router typically stores one or more rou...
Elliott Karpilovsky, Jennifer Rexford