Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)

Page title matches

  • ...a certain type of bad array. Every better-quasi-ordering is a [[well-quasi-ordering]]. Though ''well-quasi-ordering'' is an appealing notion, many important infinitary operations do not prese ...
    8 KB (1,194 words) - 07:39, 26 February 2025
  • ...ordering|the multiset variant of the recursive path ordering|multiset path ordering}} ...''Dershowitz–Manna ordering''' is a [[Well-founded relation|well-founded]] ordering on [[multiset]]s named after [[Nachum Dershowitz]] and [[Zohar Manna]]. It ...
    3 KB (379 words) - 00:11, 29 August 2023

Page text matches

  • ...ordering|the multiset variant of the recursive path ordering|multiset path ordering}} ...''Dershowitz–Manna ordering''' is a [[Well-founded relation|well-founded]] ordering on [[multiset]]s named after [[Nachum Dershowitz]] and [[Zohar Manna]]. It ...
    3 KB (379 words) - 00:11, 29 August 2023
  • == Canonical ordering == ...<math>X^{\operatorname{b}}</math> called the '''{{visible anchor|canonical ordering}}'''. ...
    3 KB (507 words) - 19:43, 7 April 2024
  • In [[general topology]], the '''lexicographic ordering on the unit square''' (sometimes the '''dictionary order on the unit square The [[lexicographical order]]ing gives a total ordering <math>\prec</math> on the points in the unit square: if (''x'',''y'') and ( ...
    3 KB (367 words) - 14:59, 20 July 2023
  • ...a certain type of bad array. Every better-quasi-ordering is a [[well-quasi-ordering]]. Though ''well-quasi-ordering'' is an appealing notion, many important infinitary operations do not prese ...
    8 KB (1,194 words) - 07:39, 26 February 2025
  • ...an space]] partially ordered by the component-wise "less than or equal to" ordering. ...math> for a partially ordered [[vector space]] <math>Z</math>. The partial ordering is induced by a cone <math>C \subseteq Z</math>. <math>X</math> is an arbit ...
    3 KB (466 words) - 09:00, 5 September 2023
  • ...es (probability distributions) according to their degree of [[risk]]; this ordering is [[Partially ordered set|partial]], meaning that of two equal-mean gamble ...is not in general true, because the variance is a complete ordering while ordering by mean-preserving spreads is only partial. ...
    5 KB (767 words) - 04:59, 21 May 2022
  • ...algorithm is different from a [[breadth-first search]], but it produces an ordering that is consistent with breadth-first search. ...for breaking such ties. In lexicographic breadth-first search, the output ordering is the order that would be produced by the rule: ...
    11 KB (1,782 words) - 16:15, 25 October 2024
  • ==Canonical ordering== .../math> and if <math>Y</math> is a locally convex space, then the canonical ordering of <math>L(X; Y)</math> defined by <math>\mathcal{H}</math> is a regular or ...
    6 KB (959 words) - 07:05, 28 April 2024
  • ...of numbers chosen from ''S'' as follows (such a sequence is called a ''p''-ordering of ''S''): ...'' for each prime number ''p''. (For a given prime number ''p'', the ''p''-ordering of ''S'' is not unique.) ...
    12 KB (1,704 words) - 07:58, 25 January 2024
  • ...less than the constant function ε, and this property does not refer to the ordering. ...
    3 KB (472 words) - 16:23, 25 March 2023
  • ...and [[liquid crystal#Smectic phases|smectics]] and also in two-dimensional ordering in 2D space such as a monomolecular adsorbed filsms at the interface betwee ...ing <math>\rho=</math>constant as the only solution and destroying the 1D ordering. ...
    4 KB (612 words) - 05:31, 8 November 2024
  • ...ed as sets but not necessarily as functions. Contour band depth allows for ordering feature-set data from the center outwards and, thus, introduces a measure t ...r-outward ordering of a collection of sets. As with other band depth, data ordering methods, set band depth, computes the probability of whether a sample lies ...
    8 KB (1,220 words) - 02:55, 30 November 2023
  • ...ponding list of observed values, and <math>\sigma</math> is an elimination ordering for variables <math>U - XE</math>, where <math>XE</math> denotes <math>X \c == Ordering == ...
    6 KB (948 words) - 19:32, 22 April 2024
  • ...ath> in clockwise order of the edges incident to <math>u_i</math> when the ordering is started from the edge <math>(u_i,u_{i+1})</math>. The tree <math>T</math ...
    5 KB (893 words) - 02:19, 29 June 2024
  • ...ble language|decidable]], owing to the existence of a kind of [[well-quasi-ordering|order]] between the states of the system which is compatible with the trans ...ll-quasi-ordering]] <math>\leq</math> on a set <math>X</math> is a [[quasi-ordering]] (i.e., a [[preorder]] or [[reflexive relation|reflexive]], [[transitive r ...
    6 KB (1,006 words) - 11:24, 30 July 2024
  • For the ordering cone <math>K \subseteq X</math> in the [[vector space]] <math>X</math>, the The order units of an ordering cone <math>K \subseteq X</math> are those elements in the [[algebraic inter ...
    3 KB (547 words) - 21:46, 1 April 2024
  • ...ted to obtaining optimal policies for multiple product problems with fixed ordering costs.<ref name=":0" /><ref>{{cite journal | title=Optimal Ordering Policies for Two-Product Inventory Models with Fixed Ordering Costs ...
    5 KB (777 words) - 23:57, 31 July 2024
  • ...athematical discipline, a '''β-model''' (from the French "bon ordre", well-ordering<ref>C. Smoryński, "[https://www.sciencedirect.com/science/article/abs/pii/S ...model we can prove that &lt; is a well-ordering, so &lt; really is a well-ordering of the natural numbers of the model.<ref name="AM" /> ...
    5 KB (818 words) - 03:26, 20 January 2025
  • ...ation from the transitivity of reachability. Therefore, it defines a total ordering on the weak components. It is the finest possible partition of the vertices ...rtices <math>u</math> and <math>v</math> could have this same reachability ordering while belonging to the same weak component as each {{nowrap|other.{{r|knuth ...
    12 KB (1,814 words) - 16:12, 7 February 2025
  • ...be specified separately, as a [[permutation]] describing the top-to-bottom ordering of the branches. ...ected diagram. The [[cyclic permutation]] of these integers, in the radial ordering of the branches around the crossing point, can be used as a purely combinat ...
    5 KB (777 words) - 09:40, 10 September 2021
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)