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
โฆ LIBER โฆ
AEGIS, an algorithm for the exhaustive generation of irredundant structures
โ Scribed by H.J. Luinge; J.H. Van Der Maas
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 767 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0169-7439
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
An algorithm for generating the positive
โ
A.K. Bose
๐
Article
๐
1976
๐
Elsevier Science
๐
English
โ 165 KB
We present a combinatorial algorithm for computing the positive roots of all nine types of simple Lie algebras over complexes. It was implemented on a programmable desk calculator. Simple Lie algebras play a key role in many bran-6
An approximate algorithm for the reanaly
โ
Kenneth T. Kavanagh
๐
Article
๐
1972
๐
Elsevier Science
๐
English
โ 582 KB
An algorithm for the simultaneous superp
โ
Simon K. Kearsley
๐
Article
๐
1990
๐
John Wiley and Sons
๐
English
โ 597 KB
A procedure is delineated for finding the optimal superposition of a series of chemical structures. Quaternions are used to represent the absolute orientation of the structures-rotations of the structures need never be carried out explicitly. The Rational Function Optimization method is used to mini
An algorithm of general application for
โ
M. Rudolph
๐
Article
๐
1990
๐
Elsevier Science
โ 397 KB
An algorithm for generation of the nodal
โ
M. Tadeusiewicz; N. Assi; G. Ciesielski
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 335 KB