๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Approximate Solution of a Variational Problem by the Shortest Path Method

โœ Scribed by D. T. Lotarev


Book ID
110392418
Publisher
SP MAIK Nauka/Interperiodica
Year
2002
Tongue
English
Weight
104 KB
Volume
63
Category
Article
ISSN
0005-1179

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An Incremental Algorithm for a Generaliz
โœ G. Ramalingam; Thomas Reps ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 363 KB

The grammar problem, a generalization of the single-source shortest-path prob-ลฝ ลฝ . ลฝ . . lem introduced by D. E. Knuth Inform. Process. Lett. 6 1 1977 , 1แސ5 is to compute the minimum-cost derivation of a terminal string from each nonterminal of a given context-free grammar, with the cost of a deriv