567 search results - page 25 / 114 » Exact train pathing |
155
Voted
SODA
2007
ACM
15 years 6 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
147
Voted
NIPS
2000
15 years 6 months ago
2000
An on-line recursive algorithm for training support vector machines, one vector at a time, is presented. Adiabatic increments retain the KuhnTucker conditions on all previously se...
182
click to vote
DAGSTUHL
2009
15 years 6 months ago
2009
We introduce and discuss the application of statistical physics concepts in the context of on-line machine learning processes. The consideration of typical properties of very large...
130
click to vote
ICPPW
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
120
click to vote
AICT
2006
IEEE
15 years 11 months ago
2006
IEEE
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...