Sciweavers

474 search results - page 28 / 95
» On Multicast Path Finding Algorithms
Sort
View
TIT
2002
81views more  TIT 2002»
13 years 7 months ago
Multicast topology inference from measured end-to-end loss
Abstract--The use of multicast inference on end-to-end measurement has recently been proposed as a means to infer network internal characteristics such as packet link loss rate and...
Nick G. Duffield, Joseph Horowitz, Francesco Lo Pr...
CCCG
2010
13 years 9 months ago
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
Xiuxia Pan, Fajie Li, Reinhard Klette
ICML
2007
IEEE
14 years 8 months ago
A kernel path algorithm for support vector machines
The choice of the kernel function which determines the mapping between the input space and the feature space is of crucial importance to kernel methods. The past few years have se...
Gang Wang, Dit-Yan Yeung, Frederick H. Lochovsky
AAAI
2010
13 years 9 months ago
Finding Optimal Solutions to Cooperative Pathfinding Problems
In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first...
Trevor Scott Standley
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
13 years 9 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska