Search results

==In ordered structures and Euclidean spaces== ...(-\infty,c)</math> and their closed counterparts are semi-infinite subsets of <math>\R</math> if <math>c</math> is finite.<ref>{{Cite book |last=Trench | ...

...-Wittenberg]],{{r|halle}} and editor-in-chief of ''Optimization: A Journal of Mathematical Programming and Operations Research''.{{r|opt}} ...nctions or Gerstewitz [[Functional (mathematics)|functionals]] in [[vector optimization]] and its generalizations.{{r|gerstewitz}} ...

...with parameters taken from ''M'') is a finite [[union (set theory)|union]] of [[interval (mathematics)|interval]]s and points. O-minimality can be regarded as a weak form of [[quantifier elimination]]. A structure ''M'' is o-minimal if and only if e ...

{{short description|Combinatorial optimization problem}} ...Interval scheduling maximization problem (ISMP)]], which is a special type of the more general [[Interval scheduling|Interval Scheduling]] problem. ...

...300 times faster than the simplex method applied to general linear program of same dimensions.<ref>{{Cite book | last1=Bazaraa | first1=Mokhtar S. | last ...gorithms for the same problem, but with a higher dependence on the numbers of edges and vertices in the graph, have been known for longer.<ref>{{citation ...

...[algebra]] to advance [[statistics]]. Algebra has been useful for [[design of experiments|experimental design]], [[parameter estimation]], and [[hypothes ...tics" has been sometimes restricted, sometimes being used to label the use of [[algebraic geometry]] and [[commutative algebra]] in statistics. ...

...real number|real]] [[coefficient]]s and let <math>S</math> be a [[subset]] of the <math>n</math>-dimensional [[Euclidean space]] <math>\mathbb{R}^n</math ...Cite book |url=https://www.worldcat.org/oclc/809420808 |title=Semidefinite optimization and convex algebraic geometry |date=2013 |others=Grigoriy Blekherman, Pablo ...

{{Short description|Optimization method}} ...cision-maker ranks the possible solutions according to a [[leximin order]] of their objective function values. ...

{{Short description|Abstraction of ordered linear algebra}} ...min-cut theorem]]. A network with the value of flow equal to the capacity of an s-t cut]] ...

...ort description|Pair of positions in a sequence where two elements are out of sorted order}} [[File:Inversion qtl1.svg|thumb|Permutation with one of its inversions highlighted. ...

...the endogenous variable. This guarantees that the set of solutions to the optimization problem is increasing with respect to the exogenous parameter. ...ed by <math>s\in S</math>, where <math>(S, \geq_S)</math> is a [[partially ordered set]] (or poset, for short). How does the [[Set-valued function|corresponde ...

...tree, representing the similarities and evolutionary history among species of [[Actinomycetota|actinobacteria]].]] ...neighbors; in a tree with more than one node, the leaves are the vertices of degree one. An unrooted binary tree is a free tree in which all internal no ...

|caption=An array of buckets, suitable for priorities in the range from 1 to 6. The minimum-prio ...emoving the minimum-priority element takes time proportional to the number of buckets or, by maintaining a pointer to the most recently found bucket, in ...

...ut|coloring infinite graphs|the number of lines determined by a finite set of points|De Bruijn–Erdős theorem (incidence geometry)}} ...ng]] of an [[infinite graph]] to the same problem on its finite [[Glossary of graph theory#subgraph|subgraphs]]. It states that, when all finite subgraph ...

| caption = A visual representation of Timsort ...reasing zip code; this is important in apps that, e.g., refine the results of queries based on user input). ... It has no bad cases (O(N log N) is worst ...

[[File:3D von Neumann Stencil Model.svg|thumb|right|The shape of a 7-point 3D [[von Neumann neighborhood|von Neumann]] style stencil.]] ...terative Stencil Loops''' (ISLs) or '''Stencil computations''' are a class of numerical data processing solution<ref name="Roth"> ...

{{Confused|score voting|text=[[range voting]], a version of approval voting that allows "in-between" approval scores}}{{Technical|date= ...that the sum of ''p_j'' is 1. It can be seen as a generalization of [[approval voting]]: in the latter, one candidate wins (''p_j'' = ...

...-in [[parallel computing]] and [[graphics processing unit|GPU]] interfaces of ''Matlab''.<ref name="gpus" /> The name of the package whimsically refers to the physical concept of [[Spin (physics)|spin]] and to [[Popeye | Popeye the Sailor]] who, in the e ...

...a generalization of a [[constraint satisfaction problem]] (CSP) where some of the [[constraint (mathematics)|constraint]]s can be violated (according to ...mvar|X}} is a finite set of discrete variables, {{mvar|C}} is a finite set of soft constraints and <math>k>0</math> is either a natural integer or <math> ...

...0/http://control.ee.ethz.ch/~apnoco/Script/15.pdf| url-status=dead}}</ref> of fuzzy logic. ...r that has no finite description whatsoever, remains somewhat in the realm of [[paradox]].<ref>{{cite book| publisher=Princeton University Press| last=Ru ...