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
  • ...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
  • #REDIRECT [[Algorithms, theory of]]
    35 bytes (4 words) - 22:25, 30 November 2014
  • ...~/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

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