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

An automaton decomposition method for program structure simplification

โœ Scribed by Yutaka Hirakawa; Keiji Okada

Book ID
112205458
Publisher
John Wiley and Sons
Year
1985
Tongue
English
Weight
796 KB
Volume
16
Category
Article
ISSN
0882-1666

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A decomposition method for structured qu
A decomposition method for structured quadratic programming problems
โœ K. Ritter ๐Ÿ“‚ Article ๐Ÿ“… 1967 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 877 KB

This paper describes a decomposition method for large structured quadratic maximization problems. The method can be applied to problems which contain coupling constraints or coupling variables occurring in the objective function.

Minimality of an Automaton Cascade Decom
Minimality of an Automaton Cascade Decomposition for Learning System Environments
โœ T.H. Westerdale ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 171 KB

We already know how to decompose any finite automaton with a strongly connected state diagram into a strongly connected version of what we call a synchronizable cascade decomposition. This is a two component cascade decomposition whose first component has a synchronizer and whose second component is

Local decomposition methods for linear p
Local decomposition methods for linear programming
โœ C. van de Panne ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 756 KB

The paper proposes decomposition methods for primal and dual block-angular systems. The decomposition used is called local because it depends on the basic solution considered. The entire problem is decomposed into a principal problem and independent subproblems. In the dual and primal local decompos