567 search results - page 14 / 114 » Exact train pathing |
109
click to vote
CPC
2006
14 years 11 months ago
2006
We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to m uniformly chosen nodes in the complete g...
102
click to vote
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
105
click to vote
IJRR
2008
14 years 11 months ago
2008
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
In the solution path algorithm of support vector regression, the penalty for violation of the required error is considered equally for every training sample, which means every tra...
115
click to vote
ICDCIT
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Statically estimating the worst case execution time of a program is important for real-time embedded software. This is difficult even in the programming language level du...