567 search results - page 33 / 114 » Exact train pathing |
NIPS
1996
15 years 1 months ago
1996
Abstract. Validation can be used to detect when over tting starts during supervised training of a neural network; training is then stopped before convergence to avoid the over ttin...
105
click to vote
AAAI
2004
15 years 1 months ago
2004
We present a probabilistic method for path planning that considers trajectories constrained by both the environment and an ensemble of restrictions or preferences on preferred mot...
WEA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportati...
MCS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The computational genome-wide annotation of gene functions requires the prediction of hierarchically structured functional classes and can be formalized as a multiclass, ...
ALENEX
2004
15 years 1 months ago
2004
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...