1015 search results - page 35 / 203 » An efficient algorithm for AS path inferring |
ICRA
2009
IEEE
13 years 5 months ago
2009
IEEE
Abstract-- Existing high-dimensional motion planning algorithms are simultaneously overpowered and underpowered. In domains sparsely populated by obstacles, the heuristics used by ...
CLUSTER
2004
IEEE
13 years 8 months ago
2004
IEEE
The efficient use of network capacity in shared restoration schemes strongly depends upon the path selection procedure. In this paper we propose and evaluate path selection algorit...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
This paper gives an efficient Bayesian method for inferring the parameters of a PlackettLuce ranking model. Such models are parameterised distributions over rankings of a finite s...
TALG
2008
13 years 8 months ago
2008
The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in...
4OR
2005
13 years 8 months ago
2005
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...