Namespaces
Variants
Views
Actions

Search results

Jump to: navigation, search
  • for Markov normal algorithms (cf. [[Normal algorithm|Normal algorithm]]) applied to words of length $ There are realization algorithms that are locally continuous in the parameters $ T _ {0} , T _ {1} , . .
    27 KB (4,142 words) - 14:55, 7 June 2020
  • ...ifurcations. For a recent survey of the literature, available software and algorithms in this field cf. [[#References|[a1]]].
    12 KB (1,799 words) - 08:05, 6 June 2020
  • ...ohen (1969), A. Macintyre (1976) and many others, gave primitive-recursive algorithms for the elimination of all quantifiers up to those which refer to formulas
    12 KB (1,846 words) - 09:28, 26 November 2016
  • ...al mechanics|Correlation function in statistical mechanics]]). It includes algorithms for establishing non-trivial estimates for equilibrium quasi-averages, enab
    11 KB (1,490 words) - 08:09, 6 June 2020
  • ...ethods, using computers (finite-difference methods and other computational algorithms for boundary value problems), acquire a special significance for the invest
    13 KB (1,857 words) - 21:26, 8 November 2014
  • The formulas and algorithms enabling one to find solutions of games can also refer to a number of optim ...racter (many of them are based on fixed-point theorems) and do not contain algorithms for finding solutions. Therefore, particular analytic and numerical methods
    25 KB (4,000 words) - 19:41, 5 June 2020
  • ...ed above (except the monadic one) are undecidable. Nevertheless, there are algorithms for undecidable logical calculi that for each derivable formula establish i
    12 KB (1,934 words) - 19:30, 28 October 2023
  • Algorithms are known which reduce the determination (description) of all solutions of such algorithms were constructed by J.L. Lagrange and C.F. Gauss, who created the general t
    32 KB (4,863 words) - 08:08, 12 August 2022
  • ...for describing computational processes or, equivalently, for writing down algorithms to be executed by computers. One distinguishes between problem-oriented alg
    12 KB (1,804 words) - 16:56, 7 February 2011
  • ...he basis of the deviance function, which was traditionally employed in GLM algorithms as both the basis of convergence and as a goodness-of-fit statistic. The lo
    30 KB (4,314 words) - 13:25, 30 May 2016
  • ...ed.) T. Mora (ed.) O. Moreno (ed.) , ''Proc. of Applied Algebra, Algebraic Algorithms and Error–Correcting Codes--AAECC-10'' , ''Lecture Notes in Computer Scie
    12 KB (1,769 words) - 08:31, 26 March 2023
  • ...]</TD> <TD valign="top"> M. Grötschel, L. Lovasz, A. Schrijver, "Geometric algorithms and combinatorial optimization" , Springer (1988) {{MR|0936633}} {{ZBL|0634
    14 KB (2,052 words) - 10:49, 21 March 2022
  • ..."top"> B.E. Sagan, "The symmetric group: representations, combinatorial algorithms, and symmetric functions" , Wadsworth&amp;Brooks/Cole (1991) (Second ed.:
    14 KB (2,001 words) - 10:09, 11 November 2023
  • .... D'yakonov, "Minimization of computational work. Asymptotically-optimal algorithms" , Moscow (1989) (In Russian)</TD></TR><TR><TD valign="top">[12]</TD> <TD
    13 KB (1,891 words) - 13:06, 13 January 2024
  • ...ts of the concepts of information and randomness by means of the theory of algorithms" ''Russian Math. Surveys'' , '''25''' : 6 (1970) pp. 82–124 ''Uspekh
    14 KB (2,246 words) - 06:44, 26 March 2023
  • .... D'yakonov, "Minimization of computational work. Asymptotically-optimal algorithms" , Moscow (1989) (In Russian)</TD></TR>
    15 KB (2,220 words) - 08:52, 10 April 2023
  • In AUTO, the numerical quality of the algorithms is strongly emphasised and the graphical user interface got less attention.
    13 KB (1,928 words) - 17:00, 1 July 2020
  • ...s for a description of all possible completions of a desired type, and for algorithms for the construction of particular ones. Completion problems arise in a var
    14 KB (2,045 words) - 15:19, 28 February 2022
  • and the development of algorithms useful in practice for a numerical solution are still far from being finall
    14 KB (2,042 words) - 19:35, 5 June 2020
  • ...he construction of its discrete analogue, the development of computational algorithms and programs for the computer realization of the discrete models, an analys
    15 KB (2,159 words) - 17:08, 7 February 2011

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