The following pages link to Cybernetics (Q3026191):
Displaying 50 items.
- The use of classification theory for automated selection of algorithms in program packages (Q3026192) (← links)
- Minimal blocking flow in networks (Q3026702) (← links)
- Reliability optimization algorithm for a compound system with different backup elements in subsystems (Q3026710) (← links)
- The equivalence problem for real-time deterministic pushdown automata (Q3028347) (← links)
- Analysis of the control processes in a multilevel organizational system (Q3028712) (← links)
- Algorithm for maximizing a linear function on the set of integral points of a convex polyhedron (Q3028720) (← links)
- Asymptotic equivalence of two finite penalty methods of first order (Q3028733) (← links)
- Qualitative investigation of path problems (Q3028750) (← links)
- Stochastic Lipschitz functions (Q3028752) (← links)
- A method of programmable iterations for differential games with information memory (Q3028758) (← links)
- Optimal control of evolutionary equations with multivalued operators (Q3029671) (← links)
- Finite method of minimizing a concave function under linear constraints and applications (Q3030588) (← links)
- Computing subdifferentials of marginal functions (Q3030590) (← links)
- Properties of differentiable multivalued mappings (Q3030598) (← links)
- Pontryagin's first direct method and some efficient methods of pursuit (Q3030616) (← links)
- Finitely additive measures and problems for minimum (Q3031531) (← links)
- Efficient algorithm for finding all minimal edge cuts of a nonoriented graph (Q3032277) (← links)
- In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton (Q3032279) (← links)
- Correlation analysis of linear dynamical systems with parameters varying randomly in the (Q3033080) (← links)
- Parameter estimation in multiple linear regression with fuzzy inequality constraints (Q3033144) (← links)
- Completeness problems in classes of computable named functions (Q3033303) (← links)
- Relationship of program correctness checking methods (Q3033305) (← links)
- Convergent sequences of automata (Q3033334) (← links)
- New algorithm for generation of spanning trees (Q3033347) (← links)
- An algorithm for the solution of the two-route Johnson problem (Q3033545) (← links)
- Solvability of transportation problems with exclusions (Q3033558) (← links)
- Probabilistic approach to assessment of heuristics in 0?1 linear programming (Q3033563) (← links)
- Discrete optimization methods for multiprocessor computer systems (Q3034793) (← links)
- Nondeterministic program schemata and their relation to dynamic logic (Q3034804) (← links)
- Application of probabilistic automata to comprehensive testing of automatic production control system software (Q3034838) (← links)
- Denotational semantics of mixed computation processes for a structural programming language (Q3034846) (← links)
- Implementation of proof schemes in the method of invariant transformations (Q3034853) (← links)
- Some special cases of the transitivity problem in the theory of graphs (Q3037484) (← links)
- Numerical method of minimizing convex functionals in the class of distribution functions satisfying nonlinear constraints (Q3038524) (← links)
- Skeletons on polyhedra (Q3040032) (← links)
- A basis of equivalence classes of paths in optimization problems (Q3040140) (← links)
- Organization of calculations in solving large systems of linear algebraic equations by the method of reflection (Q3040414) (← links)
- Analytical investigation of a class of dynamical models. II (Q3040881) (← links)
- Associative processors as a tool for maximal parallelism (Q3042378) (← links)
- Structure analysis of algorithms with the purpose of elucidating the possibilities of parallel execution (Q3042380) (← links)
- Concept formation in a semantic network (Q3042445) (← links)
- The simplex method in coordinate-free formulation (Q3042872) (← links)
- Use of a finite penalty in convex programming problems for global convergence of Newton's method with steep adjustment (Q3042890) (← links)
- Correcting the description of control algorithms by limited entry decision tables (Q3216422) (← links)
- Stability, parametric, and postoptimality analysis of discrete optimization problems (Q3216432) (← links)
- Multilevel synthesis of structured programs (Q3217580) (← links)
- An algorithm for maximum desequencing of repetition-free loops (Q3217586) (← links)
- Efficiency and optimality of one method of distributing program resources in multiprocessor computer systems (Q3221394) (← links)
- Parallel computations on graphs (Q3221400) (← links)
- Solvability of theories of certain classes of elimination graphs (Q3222869) (← links)
