• BEAST

  • Referenced in 48 articles [sw12588]
  • Monte Carlo (MCMC) to average over tree space, so that each tree is weighted proportional...
  • ParEGO

  • Referenced in 58 articles [sw10968]
  • uses a binary search tree to divide up the decision space, and tries to sample...
  • SHARPE

  • Referenced in 42 articles [sw03100]
  • such as fault-trees and queuing networks and state-space ones such as Markov...
  • evtree

  • Referenced in 11 articles [sw14304]
  • efficient heuristic, the results of recursive tree methods are only locally optimal, as splits ... search over the parameter space of trees is to use global optimization methods like evolutionary...
  • SDSL

  • Referenced in 9 articles [sw23210]
  • such as a bitvector or a tree) in space close to the information-theoretic lower...
  • PhyML

  • Referenced in 11 articles [sw10915]
  • various options to search the space of phylogenetic tree topologies, going from very fast...
  • STEM-hy

  • Referenced in 7 articles [sw23618]
  • compute the ML species tree, search the space of all species trees...
  • FindSteinerTree

  • Referenced in 12 articles [sw08245]
  • find Steiner minimal trees in Euclidean d-space. Algorithmica 7:137–177). This algorithm uses ... approach. It will therefore find the optimal tree, but the computational effort increases very rapidly...
  • GADGET

  • Referenced in 44 articles [sw12701]
  • combines this with a scheme for dynamic tree updates. Due to its Lagrangian nature, GADGET ... dynamic range to be bridged, both in space and time. So far, GADGET has been...
  • CompHep

  • Referenced in 39 articles [sw06473]
  • diagrams and integration over multi-particle phase space. CompHEP is a package for automatic calculations ... lowest order of perturbation theory (the tree approximation). The main idea prescribed into the CompHEP...
  • GameShrink

  • Referenced in 11 articles [sw12511]
  • with observable actions and an ordered signal space, we prove that any Nash equilibrium ... structure we call the signal tree. It is no larger than the game tree ... time and space complexity sublinear in the size of the game tree. Using GameShrink...
  • Phylo-MCOA

  • Referenced in 2 articles [sw18727]
  • method to explore the genomic tree space and detect outlier genes and species based ... between all the species in all the trees, simultaneously. This is achieved by using MCOA...
  • HHCART

  • Referenced in 4 articles [sw38489]
  • trees are a popular technique in statistical data classification. They recursively partition the feature space ... basic Classification and Regression Tree (CART) algorithm partitions the feature space using axis parallel splits ... produce a complicated boundary structure. Oblique decision trees use oblique decision boundaries to potentially simplify...
  • gromovlab

  • Referenced in 1 article [sw24011]
  • type l^p distances for labeled metric spaces. These distances were introduced in V.Liebscher, Gromov ... Metrics on Tree Space. preprint arXiv:1504.05795, for phylogenetic trees but may apply to much...
  • UFL

  • Referenced in 60 articles [sw11183]
  • differentiation of forms and expressions, arbitrary function space hierarchies for multifield problems, general differential operators ... software library. The library generates abstract syntax tree representations of variational problems, which are used...
  • Pylogeny

  • Referenced in 1 article [sw28977]
  • search, and analysis of the phylogenetic tree combinatorial space. Scoring of trees in this library ... methods to search these spaces. Build and rearrange phylogenetic trees using preset operators (such...
  • CayMos

  • Referenced in 2 articles [sw17439]
  • Algorithm 951: Cayley analysis of mechanism configuration spaces using CayMos: software functionalities and architecture ... dimensional (2D) mechanisms called 1-dof tree-decomposable linkages, we present a software package, CayMos ... author et al. [“Cayley configuration spaces of 1-dof tree-decomposable linkages, part I: Extreme ... arXiv:1112.6008); “Cayley configuration spaces of 1-dof tree-decomposable linkages, part II: Combinatorial characterization...
  • FastXML

  • Referenced in 5 articles [sw30152]
  • FastXML: A Fast, Accurate and Stable Tree-classifier for eXtreme Multi-label Learning. The objective ... extremely large label space. FastXML is an efficient tree ensemble based extreme classifier that...
  • QuickLex

  • Referenced in 2 articles [sw23063]
  • improve the space and time complexity. Among the existing algorithms, the Tree algorithm ... smallest time complexity and requires $O(|P|)$ space, which is linear to the size ... requires much smaller space than $O(|P|)$. From our experiments, the Tree algorithm requires ... more memory space than QuickLex. Moreover, QuickLex is 4 times faster than Tree even though...
  • Gaphyl

  • Referenced in 3 articles [sw10527]
  • methods to navigate through the space of possible trees in an attempt to find...