...<TR><TD valign="top">[2]</TD> <TD valign="top"> A.A. Markov, "Theory of algorithms" , Israel Program Sci. Transl. (1961) (Translated from Russian) (Also: T
3 KB (462 words) - 20:23, 31 July 2014
...ective computational procedure is suitably formalized, as in the theory of algorithms.
3 KB (490 words) - 22:33, 10 January 2016
...ntionally called algorithms (in the present context, one is concerned with algorithms operating on words).
...treatment of existential statements leads to the necessity of considering algorithms. The assertion that a constructive objects with a given property exists, th
20 KB (2,913 words) - 07:40, 14 August 2023
Algorithms are known for finding all classes of boundary forms. In particular, the Vor
3 KB (421 words) - 22:10, 5 June 2020
...f. [[Recursive function|Recursive function]]) is realized in the theory of algorithms. One of the general methods for constructing such hierarchies is based on d
...]</TD> <TD valign="top"> , ''Problems of mathematical logic. Complexity of algorithms and of classes of computable functions'' , Moscow (1970) (In Russian; tra
9 KB (1,244 words) - 22:10, 5 June 2020
...of programming them relies, to a large extent, on ideas from the theory of algorithms and mathematical cybernetics. In turn, practical work with computers poses
...valign="top">[5]</TD> <TD valign="top"> , ''Complexity of computations and algorithms'' , Moscow (1974) (In Russian; translated from English) (Collection of t
18 KB (2,656 words) - 04:11, 6 June 2020
...ity of an|Algorithm, computational complexity of an]]). In practice, exact algorithms are used for solving only moderately sized problem instances. This results
...M.G.C. Resende, "Parallel search for combinatorial optimization: genetic algorithms, simulated annealing, tabu search and GRASP" , ''Lecture Notes in Computer
10 KB (1,422 words) - 14:35, 19 May 2024
...e algorithms of variable directions have been proposed and examined. These algorithms are economic in the sense that the number of arithmetic operations necessar
18 KB (2,500 words) - 06:21, 12 October 2023
...hich connect this pair of vertices. Criteria have been found and effective algorithms have been developed for the establishment of the degree of connectivity of
cf. [[Flow in a network|Flow in a network]]). Various effective algorithms for finding the maximum flow have been developed.
13 KB (1,976 words) - 20:08, 15 March 2023
A method for obtaining a class of iteration algorithms (cf. [[Iteration algorithm|Iteration algorithm]]) for finding a simple real
3 KB (505 words) - 14:56, 14 February 2020
...decoding|coding and decoding]]; [[Combinatorics|combinatorics]]; geometric algorithms, and other areas.
3 KB (421 words) - 22:15, 5 June 2020
...ence are usually described by a transitive anti-reflexive binary relation. Algorithms for the evaluation of characteristics of large partially ordered sets of jo
...ical programming]] are often applicable to the development of optimization algorithms of this kind. Work on $ {\mathcal N} {\mathcal P} $-
21 KB (3,117 words) - 10:04, 18 February 2021
...tic translation]]). In mathematical linguistics methods of the theories of algorithms, automata and algebra are widely used. Keeping its applied sense, mathemati
...Therefore it is suitable not to construct deterministic effective systems (algorithms) but to construct non-deterministic systems (calculi), which allow either f
14 KB (2,122 words) - 17:14, 3 November 2014
The practical search of extrema uses iterative algorithms of the form:
...and parallel computation of an extremum by several methods, composition of algorithms of the form $ \widehat{X} = \widehat{X} _ {2} ( \widehat{X} _ {1} ( \c
13 KB (1,911 words) - 08:00, 6 June 2020
...ve sequence of rational numbers is treated the same way. Schemes of normal algorithms can be uniquely coded by words over the alphabet $ \{ 0 , 1 \} $.
...r and equality, as well as the arithmetical operations (these are given by algorithms). The system of constructive real numbers with these order and equality rel
20 KB (2,978 words) - 19:15, 18 January 2024
The idempotent correspondence principle is also valid for algorithms and their software and hardware implementations (cf. [[Idempotent algorithm
4 KB (499 words) - 20:46, 16 November 2023
...1]</TD> <TD valign="top"> J. Céa, "Lectures on optimization: theory and algorithms" , Springer (1978)</TD></TR><TR><TD valign="top">[12]</TD> <TD valign="top
...TD valign="top"> E.R. Edge, W.F. Powers, "Function-space quasi-Newton algorithms for optimal control problems with bounded controls and singular arcs" ''J.
22 KB (3,158 words) - 19:38, 5 June 2020
.... Comprehensive introductions to quantum computation and the known quantum algorithms may be found in [[#References|[a2]]], [[#References|[a1]]].
...quantum circuits) are preferred for describing and investigating specific algorithms. To obtain a quantum version of a classical model of deterministic computat
15 KB (2,154 words) - 17:45, 1 July 2020
...valign="top"> V.V. Voevodin, "Numerical methods of algebra. Theory and algorithms" , Moscow (1966) (In Russian)</TD></TR><TR><TD valign="top">[2]</TD> <TD
4 KB (619 words) - 08:04, 6 June 2020
Convergence properties of stochastic approximation and other recursive algorithms have been the subject of much research. One approach is the "ordinary diff
...[a2]</TD> <TD valign="top"> L. Ljung, "Analysis of recursive stochastic algorithms" ''IEEE Trans. Autom. Control'' , '''AC-22''' (1977) pp. 551–575</TD><
9 KB (1,349 words) - 08:23, 6 June 2020