Sciweavers

707 search results - page 42 / 142
» Solving path problems on the GPU
Sort
View
TON
1998
68views more  TON 1998»
14 years 11 months ago
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
Abstract—The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long...
Rainer R. Iraschko, Mike H. MacGregor, Wayne D. Gr...
COCOON
2001
Springer
15 years 4 months ago
Finding the Most Vital Node of a Shortest Path
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
Enrico Nardelli, Guido Proietti, Peter Widmayer
CORR
2011
Springer
163views Education» more  CORR 2011»
14 years 3 months ago
Suboptimal Solution Path Algorithm for Support Vector Machine
We consider a suboptimal solution path algorithm for the Support Vector Machine. The solution path algorithm is an effective tool for solving a sequence of a parametrized optimiz...
Masayuki Karasuyama, Ichiro Takeuchi
AROBOTS
2006
108views more  AROBOTS 2006»
14 years 12 months ago
Relative localization using path odometry information
All mobile bases suffer from localization errors. Previous approaches to accommodate for localization errors either use external sensors such as lasers or sonars, or use internal s...
Nakju Lett Doh, Howie Choset, Wan Kyun Chung
ICCS
2001
Springer
15 years 4 months ago
A Feynman-Kac Path-Integral Implementation for Poisson's Equation
This study presents a Feynman–Kac path-integral implementation for solving the Dirichlet problem for Poisson’s equation. The algorithm is a modified “walk on spheres” (WO...
Chi-Ok Hwang, Michael Mascagni