Namespaces
Variants
Views
Actions

Search results

Jump to: navigation, search

Page title matches

  • 10 KB (1,498 words) - 14:47, 3 February 2024
  • 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) - 06:10, 19 April 2013
  • #REDIRECT [[Algorithms, theory of]]
    35 bytes (4 words) - 22:25, 30 November 2014
  • ...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) - 12:42, 19 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) - 16:10, 1 April 2020
  • $#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) - 17:59, 1 April 2020
  • ...~/encyclopedia/old_files/data/O068/O.0608550 Optimization of computational algorithms ...possessing these properties. For this reason, in the theoretical study of algorithms one introduces a class of problems $ P $
    12 KB (1,798 words) - 20:07, 12 January 2024
  • ...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) - 11:59, 12 August 2014

Page text matches

  • #REDIRECT [[Algorithms, theory of]]
    35 bytes (4 words) - 22:25, 30 November 2014
  • ...me alphabet, the concepts of equivalence and complete equivalence of these algorithms with respect to it can be naturally introduced. ...<TR><TD valign="top">[1]</TD> <TD valign="top"> A.A. Markov, "Theory of algorithms" , Israel Program Sci. Transl. (1961) (Translated from Russian) (Also: T
    2 KB (301 words) - 15:11, 24 December 2018
  • ...s [[Optimization of computational algorithms|optimization of computational algorithms]]. Sometimes, however, these concepts are treated differently. For example,
    634 bytes (96 words) - 17:07, 7 February 2011
  • ''for a given class of algorithms'' ...machines it is the universal [[Turing machine|Turing machine]], for normal algorithms it is the [[Universal normal algorithm|universal normal algorithm]], etc.
    1 KB (162 words) - 15:10, 3 August 2014
  • ...olutionary strategies; evolutionary programming; genetic programming. Such algorithms and ideas have found many applications in, e.g.: [[Scheduling theory|schedu ...r><td valign="top">[a5]</td> <td valign="top"> Z. Michalewicz, "Genetic algorithms $+$ data structures $=$ evolution programs" , Springer (1992)</td></tr><tr
    2 KB (296 words) - 16:58, 1 July 2020
  • ...ho, J.E. Hopcroft, J.D. Ullman, "The design and analysis of computer algorithms" , Addison-Wesley (1976)</TD></TR> <TR><TD valign="top">[a2]</TD> <TD valign="top"> S. Even, "Graph algorithms" , Computer Sci. Press (1979)</TD></TR>
    3 KB (440 words) - 21:26, 15 November 2014
  • ...basis of which lies a certain synthesis of ideas in the theory of sets and algorithms (see [[#References|[2]]]).
    1 KB (150 words) - 17:27, 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) - 17:59, 1 April 2020
  • ...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) - 12:42, 19 August 2014
  • ...]] used in the numerical research into random processes and phenomena, and algorithms of the [[Monte-Carlo method|Monte-Carlo method]] for solving deterministic ...[#References|[4]]]). Particularly effective are those stochastic numerical algorithms that allow a number of realizations of the algorithm to be made simultaneou
    5 KB (649 words) - 17:24, 7 February 2011
  • ...t one to use small efficient algorithms as building blocks for larger-size algorithms [[#References|[a3]]]. ...ign="top">[a3]</TD> <TD valign="top"> R.C. Agarwal, J.W. Cooley, "New algorithms for digital convolution" ''IEEE Trans. Acoustics, Speech and Signal Proces
    3 KB (414 words) - 08:29, 6 June 2020
  • ...a sequence representation may define $2^l$ equivalence relations. Genetic algorithms implicitly process these relations in a very parallel manner and detect goo ...neration to generation through selection, crossover, and mutation. Genetic algorithms use such operators for detecting better relations and classes that finally
    6 KB (810 words) - 15:55, 10 July 2014
  • ...ithm of one kind or another — Turing machines, recursive functions, normal algorithms, and others — one may, by virtue of Church' thesis, restrict oneself to i
    3 KB (422 words) - 18:10, 12 December 2014
  • .... Zharov, "The complexity of a universal normal algorithm" , ''Theory of algorithms and mathematical logic'' , Moscow (1974) pp. 34–54 (In Russian)</TD></ ...lign="top"> A.A. Markov, N.M. [N.M. Nagornyi] Nagorny, "The theory of algorithms" , Kluwer (1988) pp. Chapt. V (Translated from Russian)</TD></TR></table
    2 KB (340 words) - 07:01, 27 May 2023
  • ...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) - 22:25, 30 November 2014
  • ...ed "theorems on universal algorithms" , dealing with the realizability of algorithms whose codings model the operation of any algorithm of this type. ...n arises — to wit, how to recognize self-applicable algorithms among other algorithms of this type — is not solvable by an algorithm of this type. This result
    4 KB (623 words) - 16:10, 1 April 2020
  • Three algorithms can perform this task. ...ty assumption [[#References|[a4]]]. A general perspective on probabilistic algorithms may be found in [[#References|[a5]]].
    5 KB (679 words) - 16:09, 1 April 2020
  • ...lign="top"> A.A. Markov, N.M. [N.M. Nagornyi] Nagorny, "The theory of algorithms" , Kluwer (1988) (Translated from Russian)</TD></TR></table>
    1 KB (227 words) - 19:42, 5 June 2020
  • * Ivan Rival (ed.), "Algorithms and Order", Kluwer (1989) {{ISBN|940107691X}} {{ZBL|0709.68004}}
    584 bytes (69 words) - 07:54, 19 March 2023
  • ...rier transform algorithms, such as the Cooley–Tukey fast Fourier transform algorithms {{Cite|CoTu}}, depend on the existence of non-trivial divisors of the trans ...m computations of prime power size $p^N$ and introduced cyclic convolution algorithms based on the polynomial version of the [[Chinese remainder theorem|Chinese
    4 KB (535 words) - 22:23, 25 April 2012
  • ...(ed.) ''The Schur complement and its applications'', Numerical Methods and Algorithms '''4''' Springer (2005) {{ISBN|0-387-24271-6}} {{ZBL|1075.15002}}
    467 bytes (70 words) - 12:24, 12 November 2023
  • A branch of mathematics and computer science concerned with finding efficient algorithms, or computational procedures, for solving geometric problems. Such problems ...metric configurations. It is impossible to list all important problems and algorithms of computational geometry, and some basic concepts and results are consider
    6 KB (957 words) - 17:46, 4 June 2020
  • ...to find primality proofs for numbers of $ 1000 $ decimal digits. For these algorithms, see the overview in [[#References|[a4]]] and the original references [[#Re ..."> E. Bach, J. Shallit, "Algorithmic number theory" , '''1: Efficient Algorithms''' , MIT (1996)</TD></TR>
    3 KB (485 words) - 22:01, 25 October 2014
  • ...D valign="top">[2]</TD> <TD valign="top"> N.M. Nagornyi, "The theory of algorithms" , Kluwer (1988) (Translated from Russian)</TD></TR></table>
    2 KB (337 words) - 22:11, 5 June 2020
  • ...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) - 16:54, 7 February 2011
  • The comparison of algorithms and the analysis of numerical problems in a Bayesian setting, cf. also [[Ba ...for inputs sharing some common properties. In a theoretical comparison of algorithms one either selects a class $P$ of inputs and defines the cost and the error
    6 KB (908 words) - 18:44, 21 March 2024
  • ...ociative calculus]]). The detailed definition and general theory of normal algorithms are set forth in [[#References|[1]]] (Chapts. I–V); see also [[#Reference ...riginal algorithm $\mathfrak A$. This convention is known in the theory of algorithms as the normalization principle. The formalization of the concept of an algo
    6 KB (927 words) - 15:08, 24 December 2018
  • ...ty, for designing and analyzing parallel combinatorial and graph-theoretic algorithms. The model focuses on the inherent level of computational parallelism witho ...n $O(\log n)$ time using $O(n)$ processors, parallel matrix multiplication algorithms running in $O(\log n)$ time using $O(n^3/\log n)$ processors, and string ma
    6 KB (940 words) - 23:19, 25 November 2018
  • ...(i.e. through schemes of general recursion). Let the complexity of normal algorithms and of Turing machines mean, respectively, the length of the encoding and t The study of the complexity of algorithms solving the finite restrictions of algorithmically unsolvable problems (the
    8 KB (1,158 words) - 16:10, 1 April 2020
  • ...tions has been an object of study in the [[Algorithms, theory of|theory of algorithms]] from the very beginning of its creation. In particular, this analogy lies
    2 KB (351 words) - 21:15, 29 January 2017
  • 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) - 06:10, 19 April 2013
  • * Ivan Rival (ed.),"Algorithms and Order", Kluwer (1989) {{ISBN|940107691X}} {{ZBL|0709.68004}}
    630 bytes (98 words) - 19:32, 17 November 2023
  • ...ic countries. It is supposed to be a standard language for the exchange of algorithms between socialistic countries. It is based on the language Algol-60 (cf. [[ ..."top">[1]</TD> <TD valign="top"> "Description of the language ALGAMS" , ''Algorithms and algorithmic languages'' : 3 , Moscow (1968) pp. 3–56 (In Russian)
    2 KB (340 words) - 17:06, 7 February 2011
  • 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) - 16:54, 7 February 2011
  • ...~/encyclopedia/old_files/data/O068/O.0608550 Optimization of computational algorithms ...possessing these properties. For this reason, in the theoretical study of algorithms one introduces a class of problems $ P $
    12 KB (1,798 words) - 20:07, 12 January 2024
  • ...e treated as an aspect of the [[idempotent correspondence principle]]. For algorithms, this heuristic principle means that "if one has an important and interest ...algorithms can often be approximated by linear ones. It is well-known that algorithms from linear algebra are convenient for parallel computations (see, e.g. [[#
    7 KB (1,079 words) - 20:39, 16 November 2023
  • ...osely connected with the theory of algorithms (cf. [[Algorithms, theory of|Algorithms, theory of]]), particularly so with the theory of abstract machines, since ...an automaton and that of obtaining corresponding estimates. Fairly simple algorithms have been developed for finite automata making it possible, with the aid of
    7 KB (975 words) - 18:49, 5 April 2020
  • ...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) - 19:56, 5 September 2017
  • ..., "Separability with respect to invariants" , ''Studies on the theory of algorithms and mathematical logic'' , '''1''' , Moscow (1973) pp. 205–210 (In Rus
    3 KB (392 words) - 17:21, 7 February 2011
  • ...The following universal functions play an important role in the theory of algorithms: 1) universal partial recursive functions for the class of all $ n $- ...TD></TR><TR><TD valign="top">[4]</TD> <TD valign="top"> A.I. Mal'tsev, "Algorithms and recursive functions" , Wolters-Noordhoff (1970) (Translated from Russ
    3 KB (435 words) - 13:01, 19 December 2020
  • ...TD></TR><TR><TD valign="top">[2]</TD> <TD valign="top"> A.I. Mal'tsev, "Algorithms and recursive functions" , Wolters-Noordhoff (1970) (Translated from Russ
    1 KB (148 words) - 17:24, 7 February 2011
  • ...d decoding algorithms that are close in their possibilities to the optimal algorithms whose existence has been proved in the theory of information transmission. ...bed on an intuitive level and have no clear mathematical description. Such algorithms always include learning processes with respect to a list of objects that ar
    7 KB (993 words) - 17:28, 7 February 2011
  • In the theory of algorithms more special kinds of $tt$-reducibility are also considered, for instance b ...gn="top"> A.N. Degtev, "Reducibilities of tabular type in the theory of algorithms" ''Russian Math. Surveys'' , '''34''' : 3 (1979) pp. 155–192 ''Uspek
    3 KB (414 words) - 21:57, 16 January 2016
  • ...(ed.) ''The Schur complement and its applications'', Numerical Methods and Algorithms '''4''' Springer (2005) {{ISBN|0-387-24271-6}}{{ZBL|1075.15002}}
    759 bytes (114 words) - 12:25, 12 November 2023
  • ..., W.H. Payne, "Generalized feedback shift register pseudorandom number algorithms" ''J. ACM'' , '''20''' (1973) pp. 456–468</td></tr><tr><td valign="top
    11 KB (1,696 words) - 19:30, 8 February 2024
  • The use of adaptive algorithms is now (1998) very widespread across such varied applications as system ide The study of adaptive algorithms is generally made through the theory of [[Stochastic approximation|stochast
    8 KB (1,242 words) - 15:31, 1 July 2020
  • ...n the computational complexity of a problem; the analysis of all permitted algorithms together with the structure of a problem can provide lower bounds (cf. also Consider a computational model for uniform algorithms over a set $\Sigma$. Two prominent examples are
    7 KB (1,161 words) - 16:46, 1 July 2020
  • .../TD> <TD valign="top"> M. Minoux, "Mathematical programming: theory and algorithms" , Wiley (1986)</TD></TR>
    1 KB (173 words) - 08:52, 25 April 2016
  • ...hms with regular closure does not coincide with the set of actually stable algorithms, construction of a closed algorithm frequently helps in investigating the s ...>[6]</TD> <TD valign="top"> A.F. Shapkin, "Closure of two computational algorithms, based on the idea of orthogonalization" ''Zh. Vychisl. Mat. i Mat. Fiz.''
    4 KB (651 words) - 17:23, 14 February 2020
  • ...<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
    1 KB (172 words) - 16:25, 1 May 2014

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