V.M. Jimenez, A. Marzal. An Algorithm for Efficient Computation of K Shortest Paths. Technical Report, DSIC-II/38/94. Depto. de Sistemas Informaticos y Computacion. Universidad Politecnica de Valencia. Spain. 1994. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Simplifying Language Through Error-Correcting Decoding - Yjuan-Carlos Amengual.. (Correct)
....Longest Common Subsequence between the expected ideal output and the output provided by the system. 3. To supervise the updating procedure in the training phase by computing the N Best alternatives which can be automatically provided by the system, using efficient techniques as those proposed in [6]. It is expected that this technique will help solving problem 3 above mentioned. While these solutions can actually solve some of the problems mentioned above, an important problem remains open: the necessity of knowing the expected ideal output beforehand for a large quantity of spontaneous ....
V.M. Jimenez, A. Marzal. An Algorithm for Efficient Computation of K Shortest Paths. Technical Report, DSIC-II/38/94. Depto. de Sistemas Informaticos y Computacion. Universidad Politecnica de Valencia. Spain. 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC