Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
On the basis of a fully discrete trigonometric Galerkin method and two grid iterations we propose solvers for integral and pseudodifferential equations on closed curves which solv...
Solving the tracking of an articulated structure in a reasonable time is a complex task mainly due to the high dimensionality of the problem. A new optimization method, called Sto...
Matthieu Bray, Esther Koller-Meier, Luc J. Van Goo...
A method that exploits an information theoretic framework to extract optimized audio features using video information is presented. A simple measure of mutual information (MI) betw...
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...