• CGAL

  • Referenced in 372 articles [sw00118]
  • search structures (kd trees for nearest neighbor search, and range and segment trees), interpolation (natural ... sorting functions, as well as a matrix search framework and a solver for linear...
  • SMAC

  • Referenced in 61 articles [sw27215]
  • speed up both local search and tree search algorithms by orders of magnitude on certain...
  • ParEGO

  • Referenced in 58 articles [sw10968]
  • algorithm, Bin_MSOPS, uses a binary search tree to divide up the decision space ... Gaussian processes surrogate model of the search landscape after every function evaluation, which it uses...
  • OPL

  • Referenced in 33 articles [sw21239]
  • specify both the search tree (search) and how to explore it (strategies). The paper also...
  • SYMPHONY

  • Referenced in 36 articles [sw04718]
  • generated dynamically throughout the search tree. The ability to handle constantly changing sets of cuts...
  • Blossom IV

  • Referenced in 36 articles [sw04781]
  • implementation is the use of multiple search trees with an individual dual-change $varepsilon...
  • Beam-ACO

  • Referenced in 24 articles [sw11745]
  • hybridizing ant colony optimization with beam search: an application to open shop scheduling. Ant colony ... regarded as a tree search method. Based on this observation, we hybridize the solution construction ... search, which is a well-known tree search method. We call this approach Beam...
  • ITP

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

  • Referenced in 15 articles [sw00036]
  • implementing scalable, parallel algorithms based on tree search. ALPS is specifically designed to support data ... describe each node in the search tree. Implementing such algorithms in a scalable manner ... between the various subproblems in the search tree, but they pose further difficulties for designing ... used to obtain bounds in each search tree node...
  • DIP

  • Referenced in 19 articles [sw09870]
  • with ​CHiPPS, which provides the underlying tree search methodology. DIP does not currently have extensive...
  • BiCePS

  • Referenced in 9 articles [sw06321]
  • implementing scalable, parallel algorithms based on tree search. ALPS is specifically designed to support data ... describe each node in the search tree. Implementing such algorithms in a scalable manner ... between the various subproblems in the search tree, but they pose further difficulties for designing ... used to obtain bounds in each search tree node...
  • LocalSolver

  • Referenced in 16 articles [sw04850]
  • solver based on efficient and reliable local-search techniques. Started in 2007, the goal ... reach of existing black-box tree-search solvers (integer or constraint programming). Having outlined...
  • WinGULF

  • Referenced in 15 articles [sw19224]
  • assist you to generate appropriate search tree with detailed information on sub-problems, current bound ... branch-and-bound procedure (with various searching strategies and branching rules) for integer...
  • CHiPPS

  • Referenced in 14 articles [sw07210]
  • COIN-OR High Performance Parallel Search Framework (CHiPPS) was developed in partnership with IBM under ... implementing scalable algorithms based on parallel tree search and is implemented in three layers. Abstract...
  • TiGERS

  • Referenced in 11 articles [sw12585]
  • identification of a reverse search tree on the vertices of the state polytope. Using these...
  • ANN

  • Referenced in 45 articles [sw09854]
  • both exact and approximate nearest neighbor searching in arbitrarily high dimensions. In the nearest neighbor ... different data structures, based on kd-trees ... decomposition trees, and employs a couple of different search strategies. The library also comes with...
  • c-sat

  • Referenced in 8 articles [sw00168]
  • lemmas and the dynamic partitioning of search trees, while the workers do search using different...
  • KRIPKE

  • Referenced in 8 articles [sw01162]
  • proof-search which will contain as a sub-tree a proof of A if there ... exponential rate at which the proof search tree for A usually grows. Hence...
  • SNESIM

  • Referenced in 6 articles [sw13366]
  • propose, through the introduction of search trees, an efficient solution to the extraction and storage ... uninformed locations in the conditioning data search neighborhood. Thus, two improvements are proposed to maximize ... training image and build the search tree, a simple method is described to minimize data...
  • DINS

  • Referenced in 8 articles [sw10145]
  • neighbourhoods at different nodes of the search tree generated by the exact solver. DINS considers...