Search results
Jump to navigation
Jump to search
Page title matches
- ...a hierarchical [[reinforcement learning]] algorithm which can build skill trees from a set of sample solution trajectories obtained from demonstration. CS ...=[[Andrew Barto]] |author4=[[Roderic Grupen]] | title= Constructing Skill Trees for Reinforcement Learning Agents from Demonstration Trajectories | book- ...8 KB (1,316 words) - 07:16, 7 July 2023
- {{Short description|Trees of significance in South Africa}} ...Dutch Cape Colony|Cape Colony]], [[Willem Adriaan van der Stel]]. The five trees are over 26 metres in height and each of their trunks have a girth of 7 met ...41 KB (5,860 words) - 06:04, 3 February 2025
- |title=The geometry of binary search trees ...ypically formulated, the online binary search tree problem involves search trees defined over a fixed key set <math>\{1,2, ..., n \}</math>. An ''access seq ...11 KB (1,751 words) - 19:27, 28 November 2023
- ...the sum of the weights of the edges of which is lowest among all spanning trees of <math>G</math>, is called a [[minimum spanning tree]] (MST). It is not n | title = Concurrent threads and optimal parallel minimum spanning trees algorithm ...19 KB (3,006 words) - 01:04, 31 July 2023
Page text matches
- ...for characterizing the group of trees which have been measured. For ''n'' trees, QMD is calculated using the [[quadratic mean]] formula: ...QMD is always greater than or equal to arithmetic mean for a given set of trees. QMD can be used in [[timber cruise]]s to estimate the standing volume of ...1 KB (240 words) - 10:58, 14 September 2022
- ...bsets of four leaves that are not related by the same [[topology]] in both trees. ...th>O(N^4)</math> time, where <math>N</math> is the number of leaves in the trees. ...3 KB (469 words) - 17:46, 5 May 2021
- ...tion|mr=0284331 |last=Jech|first= Thomas J.|authorlink=Thomas Jech|title= Trees|journal= [[Journal of Symbolic Logic]]|volume= 36 |year=1971|pages= 1–14|do ...in|first=Renling|title=The differences between Kurepa trees and Jech-Kunen trees|journal=[[Archive for Mathematical Logic]]|volume=32|page=369–379|year=1993 ...2 KB (271 words) - 22:55, 29 January 2023
- ...ess-date=December 20, 2010}}</ref> and [[boolean algebra|boolean]]. These trees can represent expressions that contain both [[unary operation|unary]] and [ ...hildren. This restricted structure simplifies the processing of expression trees. ...4 KB (584 words) - 18:17, 24 February 2024
- ...ering of the children of each vertex. In a random recursive tree, all such trees are equally likely. {{harvtxt|Zhang|2015}} lists several applications of random recursive trees in modeling phenomena including disease spreading, [[pyramid scheme]]s, the ...3 KB (506 words) - 15:15, 9 January 2024
- ...ots, T_m</math> each containing <math>n</math> leaves. The leaves of these trees are given labels from some set <math>L</math> with <math>|L|=n</math> so th ....|date=1997-12-01|title=Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms|journal=SIAM Journal on Computing|volume= ...3 KB (416 words) - 03:52, 20 January 2025
- ...describes some properties of objects such as [[Tree (graph theory)|rooted trees]] and [[vector field]]s on [[affine space]]. === Rooted trees === ...4 KB (686 words) - 01:52, 13 September 2024
- {{Short description|Trees with additional directed half edges}} ...print= 1305.1312v3|title= Generic method for bijections between blossoming trees and planar maps|date=2015|class= math.CO}}</ref> ...5 KB (757 words) - 16:22, 6 November 2024
- {{About|rooted trees with three children per node|unrooted trees with three neighbors per node|unrooted binary tree}} Ternary trees are used to implement [[Ternary search tree]]s and [[Ternary heap]]s. ...7 KB (1,118 words) - 21:41, 19 July 2023
- ...rem is closely related to [[Kirchhoff's theorem]] on counting the spanning trees of a graph, from which it can be derived.{{r|williams}} It was first stated ...es for the states of the Markov chain, defined to be [[Tree (graph theory)|trees]], directed toward a designated root, in which all directed edges are valid ...4 KB (607 words) - 08:00, 10 January 2025
- == Subgraphs and trees == ...rder induced by set inclusion on the subgraphs of <math>X</math> which are trees.<ref name="hatcher" /> ...4 KB (564 words) - 07:55, 21 February 2024
- ...ion types", such as [[list (computing)|lists]] and [[tree (data structure)|trees]], to be represented in a uniform way. A ([[unary operation|unary]]) contai For trees, the shape type is the type of trees of units (that is, trees with no information in them, just structure). The corresponding position ty ...3 KB (452 words) - 15:16, 24 June 2024
- ...science)|strings]]. Higher arities lead to proper [[Tree (automata theory)|trees]]. [[Category:Trees (data structures)]] ...1 KB (220 words) - 20:16, 6 April 2023
- ...e-Carlo]] variants (see [[Rapidly exploring random tree]]). Space-filling trees have interesting parallels in nature, including [[fluid distribution system ...a 2009 tech report <ref>Kuffner, J. J. and S. M. LaValle: ''Space-filling Trees'', The Robotics Institute, Carnegie Mellon University, CMU-RI-TR-09-47, 200 ...7 KB (990 words) - 20:16, 20 April 2024
- ...)|trees]] with seven labeled nodes.<ref>{{Cite OEIS|A000272|name=Number of trees on n labeled nodes: n^(n-2)}}</ref> ...2 KB (212 words) - 15:52, 31 December 2024
- ...[parallel computers]] have been proposed in recent years. '''Optical Multi-Trees with Shuffle Exchange''' (OMTSE) using both electronic and optical links am ...th a complete [[binary tree]]s of height one and the roots of these binary trees are connected with [[Shuffle-exchange network|Shuffle-Exchange]] fashion. ...3 KB (383 words) - 22:24, 2 November 2024
- ...]], is a method in [[graph theory]] for representing [[tree (graph theory)|trees]]. The tree is viewed as a [[directed graph]] that contains two directed e ...takes to sort ''n'' items in parallel) if the tree has ''n'' nodes, as in trees the number of edges is one less than the number of nodes. ...6 KB (1,012 words) - 07:56, 2 November 2024
- ...nes a commonly used [[term (logic)|term]] tree structure. A set of labeled trees is called a ''tree language''. ...''). The trees that satisfy this property are called ''ranked'' trees. The trees that do not (necessarily) satisfy that property are called ''unranked''. ...4 KB (627 words) - 15:17, 29 August 2023
- ...n - \sum_{i=1}^{k-1} 2^{2^i}</math>. Therefore, the number of items in all trees and the number of elements in all deques both add up to <math>n</math>. ...at has been inserted in the data structure is stored in exactly one of the trees and its corresponding deque. ...8 KB (1,469 words) - 03:00, 21 March 2021
- ...' = ''t''(''G'') counting the number of [[spanning tree|spanning trees]] of a graph (also see [[Kirchhoff's theorem]]). It was later found that th ===Spanning trees=== ...4 KB (674 words) - 23:47, 27 February 2025