RO EN
Grammar flow analysis reduction to scheduling problem
Authors: Ciubotaru Constantin
– 0.15 Mb
Abstract
The article describes a variant of GFA problem connected with shared storage. It shows that this GFA problem may be reduced to a well known problem of scheduling theory (the Bellmann-Johnson problem for two-machine conveyer system). It proposes an effective algorithm to solve a particular case of the problem.K.Chebotar
Institute of Mathematics,
Academy of Sciences of Moldova,
5 Academiei str., Kishinev,
MD 2028, Moldova
phone: (373-2) 738073
e-mail:
Institute of Mathematics,
Academy of Sciences of Moldova,
5 Academiei str., Kishinev,
MD 2028, Moldova
phone: (373-2) 738073
e-mail:
Fulltext
– 0.15 Mb
Contents
- On program correctness and teaching programming
- On graphs G of diameter two with f(G)J|V(G)|+D-d+1
- On the architecture of problem-oriented simulation systems
- SimW - software for automatic creation of problem-oriented simulation systems
- Two problems concerning dynamic flows in node and arc capacitated networks
- The study of data and control flows and the user's interface organization in an applied system for chemistry and medicine
- A method of Romanian Lexicon compression
- Design of the Sequential System Automata using Temporal Equivalence Classes
- Grammar flow analysis reduction to scheduling problem
