language:
Find link is a tool written by Edward Betts.searching for Tree-depth 23 found (39 total)
alternate case: tree-depth
Novell Storage Services
(224 words)
[view diff]
no match in snippet
view article
find links to article
NSS Maximum open files per server: no practical limit Maximum directory tree depth: limited only by client Maximum volumes per partition: unlimited MaximumMerkle tree (1,790 words) [view diff] no match in snippet view article find links to article
making some proofs tighter. Some implementations limit the tree depth using hash tree depth prefixes before hashes, so any extracted hash chain is definedNetWare File System (489 words) [view diff] no match in snippet view article find links to article
partition: 8 Maximum open files per server: 100,000 Maximum directory tree depth: 100 levels Characters used: ASCII double-byte Maximum extended attributes:Star coloring (477 words) [view diff] exact match in snippet view article find links to article
Ossona de Mendez (2006) to all low-tree-depth colorings (standard coloring and star coloring being low-tree-depth colorings with respective parameterIsolation forest (4,553 words) [view diff] no match in snippet view article find links to article
informative features prevents overfitting and improves generalization. Tree Depth : Tree depth determines the maximum number of splits for a tree. Deeper treesSuperPascal (1,793 words) [view diff] no match in snippet view article find links to article
procedure tree(depth: integer, bottom: channel); var left, right: channel; begin if depth > 0 then begin open(left, right); parallel tree(depth - 1, left)Du (Unix) (633 words) [view diff] no match in snippet view article
the storage usage for the specified scope -d #, The maximum directory tree depth of the scope; deeper directories are ignored; for example, 0 sums theSearch tree (710 words) [view diff] no match in snippet view article find links to article
while max.right is not NULL max := max.right return max.key Trie Binary tree Depth-first search Black, Paul and Pieterse, Vreda (2005). "search tree". DictionaryAnd–or tree (597 words) [view diff] no match in snippet view article find links to article
strategies for searching the space are possible. These include searching the tree depth-first, breadth-first, or best-first using some measure of desirabilityDecision tree pruning (986 words) [view diff] no match in snippet view article find links to article
by replacing a stop () criterion in the induction algorithm (e.g. max. Tree depth or information gain (Attr)> minGain). Pre-pruning methods are consideredIEEE 1394 (5,793 words) [view diff] no match in snippet view article find links to article
order in which the self-IDs are assigned is equivalent to traversing the tree depth-first, post-order. FireWire is capable of safely operating critical systemsBounding interval hierarchy (1,107 words) [view diff] no match in snippet view article find links to article
precision during construction and traversal Flatter tree structure (decreased tree depth) compared to kd-trees To construct any space partitioning structure someTransposition table (1,272 words) [view diff] no match in snippet view article find links to article
result in significantly reduced tree size. Replacement is usually based on tree depth and aging: nodes higher in the tree (closer to the root) are favored,Iterative deepening depth-first search (2,548 words) [view diff] no match in snippet view article find links to article
as return value to signal IDDFS to continue deepening or stop, in case tree depth and goal membership are unknown a priori. Another solution could use sentinelRay tracing (graphics) (7,806 words) [view diff] no match in snippet view article
scene, using this with a maximum depth of 15 resulted in an average ray tree depth of 1.7. Enclosing groups of objects in sets of bounding volume hierarchiesSLD resolution (1,574 words) [view diff] no match in snippet view article find links to article
the search strategy for exploring the search tree. Prolog searches the tree depth-first, one branch at a time, using backtracking when it encounters a failureShmuel Onn (1,423 words) [view diff] exact match in snippet view article find links to article
n-fold integer programming, and the broader theory of sparse and bounded tree-depth integer programming, shown to be fixed-parameter tractable. These theoriesGradient boosting (4,245 words) [view diff] no match in snippet view article find links to article
validation data set. Another regularization parameter for tree boosting is tree depth. The higher this value the more likely the model will overfit the trainingSuffix array (3,775 words) [view diff] no match in snippet view article find links to article
{\mathcal {O}}(n)} and can be converted into a suffix array by traversing the tree depth-first also in O ( n ) {\displaystyle {\mathcal {O}}(n)} , so there existLinked timestamping (1,715 words) [view diff] no match in snippet view article find links to article
l {\displaystyle N=2^{l}} , where l {\displaystyle l} denotes binary tree depth). Current security proofs work on the assumption that there is a hardNegamax (1,776 words) [view diff] no match in snippet view article find links to article
(β) represent lower and upper bounds for child node values at a given tree depth. Negamax sets the arguments α and β for the root node to the lowest andMethod of analytic tableaux (11,782 words) [view diff] no match in snippet view article find links to article
in a depth-first manner with iterative deepening: one first visits the tree depth first up to a certain depth, then increases the depth and perform theTree contraction (2,215 words) [view diff] exact match in snippet view article find links to article
Ossona de Mendez, Patrice (2012), "Chapter 6. Bounded height trees and tree-depth", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics