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

Optimal parallel algorithms for dynamic expression evaluation and context-free recognition

โœ Scribed by Alan Gibbons; Wojciech Rytter


Book ID
113383904
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
823 KB
Volume
81
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Almost optimal sublinear time parallel r
โœ Lawrence L. Larmore; Wojciech Rytter ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 803 KB

Sublinear time almost optimal algorithms for the recognition problem for three basic subclasses of context-free languages (unambiguous, deterministic and linear) are presented. Optimality is measured with respect to the work of the best-known sequential algorithm for a given problem.

Parallel asynchronous algorithms for opt
โœ S. S. Abdelwahed; M. F. Hassan; M. A. Sultan ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 153 KB ๐Ÿ‘ 2 views

This paper presents two parallel asynchronous algorithms for the solution of the optimal control problem of linear large-scale dynamic systems. These algorithms are based on the prediction concept. The first one adopts the interaction prediction approach and the second is based upon the costate pred