non-decreasing

  • 81Golomb sequence — In mathematics, the Golomb sequence, named after Solomon W. Golomb (but also called Silverman s sequence), is a non decreasing integer sequence where an is the number of times that n occurs in the sequence, starting with a 1 = 1, and with the… …

    Wikipedia

  • 82Skorokhod's embedding theorem — In mathematics and probability theory, Skorokhod s embedding theorem is either or both of two theorems that allow one to regard any suitable collection of random variables as a Wiener process (Brownian motion) evaluated at a collection of… …

    Wikipedia

  • 83Consistent heuristic — In computer science, a consistent (or monotone) heuristic function is a strategy for search that approaches the solution in an incremental way without taking any step back. Formally, for every node N and every successor P of N generated by any… …

    Wikipedia

  • 84Tanaka's formula — In the stochastic calculus, Tanaka s formula states that:|B t| = int 0^t sgn(B s) dB s + L twhere B t is the standard Brownian motion, sgn denotes the sign function:sgn (x) = egin{cases} +1, x geq 0; 1, x < 0. end{cases}and L t is its local time …

    Wikipedia

  • 85Modulus and characteristic of convexity — In mathematics, the modulus and characteristic of convexity are measures of how convex the unit ball in a Banach space is. In some sense, the modulus of convexity has the same relationship to the ε δ definition of uniform convexity as the modulus …

    Wikipedia

  • 86Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all&#160;8 corners of the Klee–Minty cube in the worst case. It visits&#160;3 additional&#8230; …

    Wikipedia

  • 87Dinic's algorithm — is a strongly polynomial algorithm for computing the maximum flow in a flow network, conceived in 1970 by Israeli (formerly Soviet) computer scientist Yefim Dinitz. The algorithm runs in O(V2E) time and is similar to the Edmonds–Karp algorithm,&#8230; …

    Wikipedia

  • 88sustainability — 1907, in reference to a legal objection, from SUSTAINABLE (Cf. sustainable) + ITY (Cf. ity). General sense (in economics, agriculture, ecology) by 1972. Sustainability is defined as a requirement of our generation to manage the resource base such …

    Etymology dictionary

  • 89nonincreasing — /non in kree sing/, adj. 1. not increasing. 2. Math. decreasing (def. 2). [1960 65; NON + INCREASING] * * * …

    Universalium

  • 90nonincreasing — /non in kree sing/, adj. 1. not increasing. 2. Math. decreasing (def. 2). [1960 65; NON + INCREASING] …

    Useful english dictionary