• VAMPIRE

  • Referenced in 232 articles [sw02918]
  • techniques are used for pruning the search space: subsumption, tautology deletion (optionally modulo commutativity), subsumption...
  • Traces

  • Referenced in 119 articles [sw07823]
  • Search Space Contraction in Canonical Labeling of Graphs. The individualization-refinement paradigm for computing ... reducing the size of the associated search space is introduced, and a new tool, named ... huge reduction in the search space, thereby making computation feasible for several classes of graphs...
  • Manopt

  • Referenced in 82 articles [sw08493]
  • where the smooth geometry of the search space can be leveraged to design efficient numerical...
  • PSATO

  • Referenced in 40 articles [sw02635]
  • processes explore disjoint portions of the search space. In this way, we use parallelism without...
  • ParEGO

  • Referenced in 51 articles [sw10968]
  • uses a binary search tree to divide up the decision space, and tries to sample ... Gaussian processes surrogate model of the search landscape after every function evaluation, which it uses ... Results indicate that the two algorithms search the space in very different ways and this...
  • Korat

  • Referenced in 31 articles [sw07259]
  • true. Korat exhaustively explores the bounded input space of the predicate but does so efficiently ... executions and pruning large portions of the search space.This paper illustrates the use of Korat ... from Java predicates, even when the search space for inputs is very large. This paper...
  • Maude-NPA

  • Referenced in 26 articles [sw12159]
  • State space reduction in the Maude-NRL protocol analyzer. The Maude-NRL Protocol Analyzer (Maude ... original NPA, looks for attacks by searching backwards from an insecure attack state, and assumes ... develop ways of reducing the search space and avoiding infinite search paths. In order ... need not only to speed up the search, but should not violate completeness, so that...
  • Alloy

  • Referenced in 29 articles [sw01247]
  • powerful enough to handle a search space of 2 100 or more. Alloy has been...
  • HdBCS

  • Referenced in 70 articles [sw29884]
  • efficient stochastic search algorithm for for exploring spaces of Gaussian Graphical Models...
  • SDPT3

  • Referenced in 597 articles [sw04009]
  • second-order cones, nonnegative orthants and Euclidean spaces; and whose objective function ... with either the HKM or the NT search direction. The basic code is written...
  • NP-SPEC

  • Referenced in 20 articles [sw02243]
  • allow to limit the size of search spaces in order to obtain reasonably efficient construction...
  • GOLEM

  • Referenced in 51 articles [sw24695]
  • this efficiency because it avoids searching a large hypothesis space for consistent hypotheses...
  • ModLeanTAP

  • Referenced in 18 articles [sw12368]
  • leanTAP. ModLeanTAP Version 2.0 includes additional search space restrictions and fairness strategies, giving a decision...
  • SOLAR

  • Referenced in 18 articles [sw00888]
  • prune away redundant branches of the search space. This paper introduces some...
  • UEGO

  • Referenced in 16 articles [sw02239]
  • search regions (or clusters) of the search space. The volume of the clusters decreases...
  • semprop

  • Referenced in 16 articles [sw28383]
  • illustrated by a comparison of the search spaces on pathological examples. We also describe...
  • Hyperopt

  • Referenced in 14 articles [sw19219]
  • serial and parallel optimization over awkward search spaces, which may include real-valued, discrete...
  • Ts2pack

  • Referenced in 13 articles [sw23796]
  • which reduces the size of the search space. We also introduce a general method ... neighborhoods, and thus the quality of the search, without increasing the overall complexity...
  • LPG

  • Referenced in 12 articles [sw20690]
  • procedure to solve SAT-problems. The search space of LPG consists of ”action graphs”, particular ... planning graph representing partial plans. The search steps are certain graph modifications transforming an action...
  • ASTRAL-II

  • Referenced in 8 articles [sw20492]
  • polynomial time, by constraining the search space using a set of allowed ‘bipartitions’. Despite ... allowed bipartitions for the search space. Availability and implementation: ASTRAL-II is available in open...