• ParEGO

  • Referenced in 68 articles [sw10968]
  • first algorithm, Bin_MSOPS, uses a binary search tree to divide up the decision space...
  • ITP

  • Referenced in 31 articles [sw09808]
  • data structures, such as ordered lists, binary search trees, priority queues, and powerlists...
  • SackinMinimizer

  • Referenced in 7 articles [sw39018]
  • than balanced ones. Also, concerning ordered search trees, more balanced ones allow for more efficient ... binary (search) trees, not for general rooted trees. Moreover, while the number of trees with ... trees with minimal and maximal Sackin indices from the literature on ordered trees and subsequently ... trees. We also extend previous studies by analyzing the case when the underlying trees need...
  • somersd

  • Referenced in 7 articles [sw26008]
  • number of observations, using a balanced binary search tree. These totals can be used...
  • Treaps

  • Referenced in 3 articles [sw28642]
  • Treaps. A Treap is a binary tree whose nodes contain pairs consisting of some payload ... associated priority. It must have the search-tree property w.r.t. the payloads and the heap ... data structure that is related to binary search trees (BSTs) in the following...
  • Random BSTs

  • Referenced in 2 articles [sw28658]
  • Expected Shape of Random Binary Search Trees. This entry contains proofs for the textbook results ... internal path length of random binary search trees (BSTs), i. e. BSTs that are formed...
  • KDTREE

  • Referenced in 3 articles [sw18200]
  • algorithms are the generalization of classical binary search trees to higher dimensional spaces, so that...
  • Splay Tree

  • Referenced in 2 articles [sw28528]
  • Splay trees are self-adjusting binary search trees which were invented by Sleator and Tarjan...
  • Auto2_Imperative_HOL

  • Referenced in 2 articles [sw32246]
  • that are verified include linked lists, binary search trees, red-black trees, interval trees, priority...
  • SHIELD

  • Referenced in 7 articles [sw20121]
  • secure multiple keyword search, and a homomorphic evaluator for binary decision trees. Our results show...
  • FSInteract

  • Referenced in 2 articles [sw19526]
  • package FSInteract. Fast Searches for Interactions. Performs fast detection of interactions in large-scale data ... using the method of random intersection trees introduced in Shah, R. D. and Meinshausen ... binary two-class classification data, without requiring lower order interactions to be informative. The search...
  • gbts

  • Referenced in 0 articles [sw19110]
  • Search for Gradient Boosted Trees. An implementation of hyperparameter optimization for Gradient Boosted Trees ... binary classification and regression problems. The current version provides two optimization methods: Bayesian optimization ... random search. Instead of giving the single best model, the final output is an ensemble ... Gradient Boosted Trees constructed via the method of ensemble selection...
  • HIBITS

  • Referenced in 4 articles [sw30626]
  • process captures the residual variations in the binary response that are not explained by covariates ... models for ordinal data, gradient boosting, decision tree and random forest. Using our proposed model ... complexity, we utilize Laplace approximation, golden section search and successive parabolic interpolation. With this paper...
  • HERBY

  • Referenced in 6 articles [sw21545]
  • binary resolution and binary factoring (Chapter 4). HERBY is a semantic-tree theorem-proving program ... theoretical foundations of semantic tree theorem proving are presented in Chapter 5) and THEO ... design of chess programs. The search techniques used in the programs of this book...
  • p3d

  • Referenced in 1 article [sw23587]
  • implementation of a binary space partitioning (BSP) tree, b) set theory and c) functions that ... that use human readable language in the search queries rather than complex computer language...
  • BARON

  • Referenced in 365 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • Boolector

  • Referenced in 32 articles [sw00085]
  • Boolector: an efficient SMT solver for bit-vectors...
  • cdd

  • Referenced in 119 articles [sw00114]
  • The program cdd+ (cdd, respectively) is a C...
  • CGAL

  • Referenced in 403 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • CoCoA

  • Referenced in 659 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...