Search results

...ision problem in formal logic|Entscheidungsproblem|analysis of the process of making choices|Decision theory}} ...s–no question]] on a [[set (mathematics)|set]] of input values. An example of a decision problem is deciding whether a given natural number is [[Prime nu ...

{{Short description|Class of mathematical functions}} ...eory]], [[economics]], [[Lattice (order)|lattice theory]], [[combinatorial optimization]], and [[machine learning]]. ...

part of the set of 830+ outlines listed at a special type of list article. ...

...ose a general technique, [[adequality]], for finding the maxima and minima of functions. ...s]] in the set, respectively. Unbounded [[infinite set]]s, such as the set of [[real number]]s, have no minimum or maximum. ...

...uence]]s of ordered symbols or, more generally, of elements of a [[totally ordered set]]. ...variant applies to sequences of different lengths by comparing the lengths of the sequences before considering their elements. ...

...set, illustrated in green. Since this is true for any potential locations of two points within the set, the set is convex.]] ...ially extends outside of the set, illustrated in red, and the intersection of the set with the line occurs in two places, illustrated in black.]] ...

...ematical folklore|treatment of the mathematics|No free lunch in search and optimization}} ...783_The_Lack_of_A_Priori_Distinctions_Between_Learning_Algorithms The Lack of ''A Priori'' Distinctions between Learning Algorithms]", ''Neural Computati ...

...erstand how the optimal value for a choice variable changes when a feature of the environment changes. The result states that if ''f'' is [[supermodular ...ntage of using Topkis's theorem is that it can be applied to a wider class of problems than can be studied with standard economics tools. ...

{{Short description|Mathematical ranking of a set}} {{distinguish|Weak order of permutations}} ...

...within the tree is minimized. Tree alignment can be accomplished using one of several algorithms with various trade-offs between manageable tree size and '''Input''': A set <math>S</math> of sequences, a [[phylogenetic tree]] <math>T</math> leaf-labeled by <math>S</ ...

{{Short description|Complements of perfect graphs are perfect}} In [[graph theory]], the '''perfect graph theorem''' of {{harvs|last=Lovász|first=László|authorlink=László Lovász|year=1972a|year2= ...

...estimated position. This method will only work if calculations on the size of differences between key values are sensible. |caption=Visualization of the interpolation search algorithm in which 24 is the target value. ...

{{Short description|Branch of geometry that studies combinatorial properties and constructive methods}} ...l geometry|text=The term combinatorial geometry is also used in the theory of [[matroid]]s to refer to a [[simple matroid]], especially in older texts}} ...

...the result of the simultaneous presence of nonlinearity and a certain type of homogeneity in a system, and can be quantum or classical. ...by [[bremsstrahlung]], [[decoherence]] and interference in the scattering of charged particles off one another, in tunneling or in any other process in ...

...convex cone (light blue). Inside of it, the light red convex cone consists of all points {{math|''αx'' + ''βy''}} with {{math|''α'', ''β'' > 0}}, for the ...{{nowrap|positive scalar <math>s</math>}}. This is a broad generalization of the standard [[cone]] in [[Euclidean space]]. ...

...u/teach_res/mp/doc/math_sinc_function.pdf |date=2017-02-15 }}", University of Sydney</ref>]] ...uments]] are defined over the [[domain of a function]], the output is part of its [[codomain]]. ...

...y cats in images, supervised learning would involve feeding it many images of cats (inputs) that are explicitly labeled "cat" (outputs). ...Mehryar Mohri]], Afshin Rostamizadeh, Ameet Talwalkar (2012) ''Foundations of Machine Learning'', The MIT Press {{ISBN|9780262018258}}.</ref> This requir ...

{{Short description|Kind of binary decision diagram}} ...des an alternative strong normal form, with improved compression of sparse sets. It is based on a reduction rule devised by [http://www.lab2.kuis.kyoto-u.a ...

{{About|intervals of real numbers and some generalizations|intervals in order theory|Interval (o ...c intervals.svg|thumb|Numeric intervals on the positive and negative sides of the [[number line]].]] ...

...tice]]s. It can be viewed as a partial [[Execution (computers)|execution]] of a [[computer program]] which gains information about its semantics (e.g., [ ...s]], the automatic extraction of information about the possible executions of computer programs; such analyses have two main usages: ...