Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...of sets. Randolph diagrams were created by mathematician John F. Randolph in 1965, during his tenure at the [[University of Arkansas]]. ...each line as ''belonging to'' or ''relating to'' one logical statement or set. Any dot above the line indicates truth or inclusion and below the line ind ...
    10 KB (1,432 words) - 17:08, 6 September 2024
  • {{Short description|Graphical language for quantum processes}} ...map between qubits can be represented as a diagram, and different sets of graphical rewrite rules are [[Completeness (logic)|complete]] for different families ...
    30 KB (4,310 words) - 22:50, 12 January 2025
  • ...t2=Ögren |first2=Petter |year=2018 |arxiv=1709.00084 |title=Behavior Trees in Robotics and AI: An Introduction |publisher=CRC Press |doi=10.1201/97804294 ...lving Behaviour Trees for the Commercial Game DEFCON |series=Lecture Notes in Computer Science |volume=6024 |year=2010 |chapter-url=http://ccg.doc.gold.a ...
    15 KB (2,159 words) - 15:21, 18 March 2024
  • In [[quantum mechanics]], and especially [[quantum information]] theory, the '''purity''' of a normalized [[quantum state]] is a scalar defined as ...fall-2012/lecture-notes/MIT22_51F12_Ch7.pdf | title=Lecture notes: Quantum Theory of Radiation Interactions, Chapter 7: Mixed states| last=Cappellaro| first= ...
    13 KB (2,020 words) - 03:10, 28 December 2024
  • ...le a [[Formula (mathematical logic)|formula]] denotes a mathematical fact. In particular, terms appear as components of a formula. This is analogous to n ...valuates to [[Truth#Truth in mathematics|true]] or [[False (logic)|false]] in [[Principle of bivalence|bivalent logics]], given an [[interpretation (logi ...
    20 KB (3,157 words) - 06:45, 20 August 2024
  • ...parse PCA) is a technique used in statistical analysis and, in particular, in the analysis of [[multivariate analysis|multivariate]] data sets. It extend ...ngs has been used for the coefficients. This is quite unfortunate, because in SPCA the coefficients are not equal to the loadings.</ref> are equal to ze ...
    16 KB (2,304 words) - 22:23, 30 December 2024
  • ...to knowledge representation in artificial intelligence and decision making in finance and accounting by Liping Liu.<ref>Liu, Liping, Catherine Shenoy, an ...ections. A linear belief function is a special type of [[belief function]] in the sense that its [[focal elements]] are exclusive, parallel sub-hyperplan ...
    23 KB (3,505 words) - 15:37, 4 October 2024
  • {{Short description|Vertex adjacent to all others in a graph}} ...ed a '''dominating vertex''', as it forms a one-element [[dominating set]] in the graph. A graph that contains a universal vertex may be called a '''cone ...
    15 KB (2,225 words) - 06:24, 4 September 2024
  • ...tificial intelligence]] communities. The law and algorithm were introduced in a semi-tutorial by Srinivas M. Aji and [[Robert McEliece|Robert J. McEliece ...plied, to each term of the binomial factor <math> b + c </math>, resulting in the product <math> a*b + a*c </math>"'' - Britannica.<ref name=Britannica> ...
    29 KB (4,983 words) - 18:37, 31 January 2025
  • ...opology. Topology is not concerned with the physical layout of components in a circuit, nor with their positions on a [[circuit diagram]]; similarly to ...tors and capacitors in a [[low-pass]] [[Electronic filter|filter]] results in a [[high-pass]] filter. These might be described as high-pass and low-pass ...
    47 KB (7,319 words) - 06:19, 19 October 2024
  • {{Machine learning|Theory}} ...It is said that there is greater [[variance]] in the model's [[estimation theory|estimated]] [[statistical parameter|parameters]]. ...
    31 KB (4,692 words) - 13:38, 19 February 2025
  • ...ambridge University Press|isbn=978-1-139-43516-1}}</ref> he developed this theory and proposed what he called “the robot,” which was not Bayesian programming may also be seen as an algebraic formalism to specify [[graphical model]]s such as, for instance, [[Bayesian network]]s, [[dynamic Bayesian n ...
    42 KB (6,242 words) - 15:32, 18 November 2024
  • ...in the [[K-means clustering|''k''-means algorithm]], is a frequent problem in [[data clustering]], and is a distinct issue from the process of actually s For a certain class of [[clustering algorithm]]s (in particular ''k''-means, [[K-medoid|''k''-medoids]] and [[expectation–maximi ...
    20 KB (2,912 words) - 00:09, 8 January 2025
  • [[File:Pythagorean proof (1).svg|300px|right|thumb|An example of "beauty in method"—a simple and elegant visual descriptor of the [[Pythagorean theorem ==In method== ...
    32 KB (4,494 words) - 11:02, 1 February 2025
  • ...[ionization]] of a strong acid in solution is effectively complete, except in its most concentrated solutions. ...dissociated acid and its dissociation products being present, in solution, in [[Equilibrium chemistry|equilibrium]] with each other. ...
    19 KB (2,922 words) - 21:49, 3 January 2025
  • ...d observations in outcrops, as well as in [[thin section]]s, are important in reconstructing the [[paleostress]] trajectories. ...959. The mechanisms of oblique slip faulting. Geol. Mag. 96,109-117.</ref> in the 1950s, similar assumptions have been used throughout the decades. ...
    26 KB (3,722 words) - 11:27, 3 January 2025
  • {{short description|General, formal theory of continuous quantity}} ...easurement''' or '''additive conjoint measurement''') is a general, formal theory of continuous [[quantity]]. It was independently discovered by the French e ...
    45 KB (6,344 words) - 00:44, 4 December 2024
  • ...e in some situations preferences can form [[cycle (graph theory)|cycles]], in which case there exists no well-defined optimal choice. An example of this ...ences possess also have major effects on [[rational choice theory]], which in turn affects all modern economic topics.<ref>{{Cite journal |last1=Hansson ...
    36 KB (5,372 words) - 08:11, 5 February 2025
  • {{wiktionary|Appendix:Glossary of set theory}} This is a glossary of terms and definitions related to the topic of [[set theory]]. ...
    90 KB (13,951 words) - 23:05, 2 December 2024
  • ...formula <math> \exists x P(x)</math> expresses that there exists something in the domain which satisfies that property. A formula where a quantifier take ...[[negation]]. They can also be used to define more complex quantifiers, as in the formula <math> \neg \exists x P(x)</math> which expresses that nothing ...
    31 KB (4,670 words) - 09:43, 29 November 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)