Namespaces
Variants
Views
Actions

Search results

Jump to: navigation, search

Page title matches

  • ...connecting algorithms of a fixed type and expressing the fact that any two algorithms thus connected yield the same results if fed with the same given type of in ...he alphabet $A$, then the second algorithm also converts $P$ to $Q$. These algorithms are called completely equivalent with respect to $A$ if for any $P$ in $A$
    4 KB (663 words) - 14:42, 19 August 2014
  • ...ecial method for constructing algorithms based on the requirement that the algorithms should be exact or have an error of prescribed order of accuracy on some se
    4 KB (621 words) - 13:59, 12 August 2014
  • $#C+1 = 33 : ~/encyclopedia/old_files/data/A011/A.0101910 Algorithms, theory of ...[Turing machine|Turing machine]]). Subsequent development of the theory of algorithms is due to the studies of Kleene, Post [[#References|[6]]], [[#References|[7
    19 KB (2,846 words) - 18:10, 1 April 2020
  • ...possessing these properties. For this reason, in the theoretical study of algorithms one introduces a class of problems <img align="absmiddle" border="0" src="h ...optimal. A scheme of studying the problem of optimization of computational algorithms, dating back to A.N. Kolmogorov [[#References|[2]]], considers the set of p
    16 KB (2,351 words) - 19:07, 7 February 2011
  • $#C+1 = 40 : ~/encyclopedia/old_files/data/A011/A.0101890 Algorithms, combinations of ...s for constructing new algorithms (cf. [[Algorithm|Algorithm]]) from given algorithms.
    6 KB (805 words) - 19:59, 1 April 2020
  • 16 KB (2,194 words) - 19:22, 7 February 2011
  • Genetic algorithms (GAs) (also known as evolutionary algorithms [EAs]) assume a discrete search space $H$ and a function $f:H\to \R$. The [1] Back, T., Evolutionary Algorithms in Theory and Practice, Oxford University Press, 1996
    6 KB (958 words) - 08:10, 19 April 2013
  • #REDIRECT [[Algorithms, theory of]]
    35 bytes (4 words) - 00:25, 1 December 2014

Page text matches

  • ...of perfect packings, as well as the possibility of constructing effective algorithms for solving these problems.
    23 KB (3,140 words) - 21:07, 11 January 2016
  • ...ssical real numbers that are computable in some sense or other by means of algorithms. (See also [[Constructive analysis|Constructive analysis]].)
    571 bytes (88 words) - 18:54, 7 February 2011
  • .../TD> <TD valign="top"> M. Minoux, "Mathematical programming: theory and algorithms" , Wiley (1986)</TD></TR>
    1 KB (173 words) - 10:52, 25 April 2016
  • The idempotent correspondence principle is also valid for algorithms and their software and hardware implementations (cf. [[Idempotent algorithm
    4 KB (499 words) - 20:20, 3 June 2016
  • Some authors make a specific distinction between algorithms and procedures. Algorithms are prescriptions of sequences of actions which should always terminate aft
    3 KB (398 words) - 18:54, 7 February 2011
  • ...60/m0651604.png" />. In practice, time-consuming scanning is combined with algorithms for finding a local extremum: by scanning and a priori reduction of <img al 1) Algorithms of the heavy-sphere type (cf. [[Heavy sphere, method of the|Heavy sphere, m
    11 KB (1,618 words) - 18:54, 7 February 2011
  • This approach to constructing computation algorithms can be extended to problems of hydrodynamics with heat conduction, to elast
    3 KB (431 words) - 12:52, 16 April 2014
  • ...n="top"> J.P. Duval, "Factorizing words over an ordered alphabet" ''J. Algorithms'' , '''4''' (1983) pp. 363–381</TD></TR>
    6 KB (945 words) - 00:28, 12 January 2016
  • ...one of the fundamental results in the general theory of algorithms (cf. [[Algorithms, theory of]]); it may be (is) used in deriving all known negative results f
    1 KB (217 words) - 00:25, 1 December 2014
  • ...nal matrix functions and on the search for explicit formulas and efficient algorithms for the construction of interpolants in a form which is suitable for engine
    12 KB (1,743 words) - 20:49, 31 March 2017
  • A number of minimization (reduction) algorithms and algorithms of automaton synthesis are associated with these methods of specifying auto ...www.encyclopediaofmath.org/legacyimages/a/a014/a014060/a014060146.png" />. Algorithms which yield the transition matrix of an automaton from formal schemes of th
    55 KB (7,528 words) - 22:16, 21 November 2014
  • ...rithm. Exact definitions of computable functions, effective procedures and algorithms were given in various forms by D. Hilbert, K. Gödel, A. Church, S.C. Kleen ...an algorithm are Turing machines, partial recursive functions, the normal algorithms of Markov, and others.
    18 KB (2,635 words) - 21:56, 5 September 2017
  • ...TD> <TD valign="top"> N.J. Higham, "Accuracy and stability of numerical algorithms" , SIAM (Soc. Industrial Applied Math.) (1996)</TD></TR></table>
    9 KB (1,235 words) - 20:33, 11 January 2016
  • ...d hence the Berlekamp–Massey algorithm, has connections to several other algorithms, most notably the extended [[Euclidean algorithm|Euclidean algorithm]] [[#R ...rithms in numerical analysis such as Lanczos recursion and Levinson–Shur algorithms for Toeplitz matrices, as well as problems of minimal realizations in syste
    13 KB (1,776 words) - 20:50, 24 March 2012
  • A method of defining functions studied in the theory of algorithms and other branches of mathematical logic. This method has been used for a l ...nition of recursion consists not only in its significance in the theory of algorithms, but also in that it permits one to look from an "algorithmic" (in the ge
    23 KB (3,188 words) - 18:56, 7 February 2011
  • A method for obtaining a class of iteration algorithms (cf. [[Iteration algorithm|Iteration algorithm]]) for finding a simple real
    3 KB (505 words) - 16:56, 14 February 2020
  • ...e algorithms of variable directions have been proposed and examined. These algorithms are economic in the sense that the number of arithmetic operations necessar
    28 KB (3,811 words) - 19:30, 30 November 2014
  • .... 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
    19 KB (2,633 words) - 18:56, 7 February 2011
  • [[Category:Algorithms]]
    2 KB (387 words) - 17:16, 20 November 2014
  • ...za, "The acyclic orientation game on random graphs" ''Random Structures Algorithms'' , '''6''' (1995) pp. 261–268 (Proc. Sixth Internat. Sem. Random Grap
    10 KB (1,519 words) - 18:08, 1 April 2020

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)