• gSpan

  • Referenced in 115 articles [sw11908]
  • order gSpan adopts the depth-first search strategy to mine frequent connected subgraphs efficiently...
  • OTTER

  • Referenced in 320 articles [sw02904]
  • Bendix completion, weighting, and strategies for directing and restricting searches for proofs. Otter can also...
  • SPG

  • Referenced in 78 articles [sw00897]
  • steplength and a nonmonotone line-search strategy. The user provides objective function and gradient values...
  • ParEGO

  • Referenced in 68 articles [sw10968]
  • algorithms that use advanced initialization and search strategies to operate better under these conditions ... first algorithm, Bin_MSOPS, uses a binary search tree to divide up the decision space...
  • PAES

  • Referenced in 94 articles [sw04159]
  • uses a simple (1+1) local search evolution strategy. Nonetheless, it is capable of finding...
  • Chaff

  • Referenced in 591 articles [sw06916]
  • careful engineering of all aspects of the search - especially a particularly efficient implementation of Boolean ... novel low overhead decision strategy. Chaff has been able to obtain one to two orders...
  • Gecode

  • Referenced in 83 articles [sw06272]
  • programming of new constraints, branching strategies, and search engines. New variable domains can be programmed...
  • RealPaver

  • Referenced in 51 articles [sw04401]
  • descent methods and metaheuristics, and several search strategies. Package: Realpaver is open source, configurable, object...
  • ANN

  • Referenced in 46 articles [sw09854]
  • employs a couple of different search strategies. The library also comes with test programs...
  • UCPOP

  • Referenced in 39 articles [sw20687]
  • determine satisfiability. With a conservative search strategy UCPOP is both sound and complete for this ... aggressive, domain-dependent search control with convenient declarative rules. Our Common Lisp implementation is simple...
  • OPL

  • Referenced in 34 articles [sw21239]
  • Search and strategies in OPL. OPL is a modeling language for mathematical programming and combinatorial ... ability to specify search procedures and strategies that are the essence of constraint programming. This ... facilities available in OPL to specify search procedures. It describes the abstractions ... both the search tree (search) and how to explore it (strategies). The paper also illustrates...
  • Bison

  • Referenced in 40 articles [sw17681]
  • favourably combines the well-known meta-strategy tabu search and a branch and bound procedure...
  • WinGULF

  • Referenced in 20 articles [sw19224]
  • branch-and-bound procedure (with various searching strategies and branching rules) for integer...
  • CCASat

  • Referenced in 13 articles [sw12924]
  • analyzes two new efficient local search strategies for the Boolean Satisfiability (SAT) problem. We start ... proposing a local search strategy called configuration checking (CC) for SAT. The CC strategy results ... simple local search algorithm for SAT called Swcc, which shows promising experimental results on random ... Competition 2009. par However, the CC strategy for SAT is still in a nascent stage...
  • GWO

  • Referenced in 112 articles [sw40816]
  • Gravitational Search Algorithm (GSA), Differential Evolution (DE), Evolutionary Programming (EP), and Evolution Strategy ... applicable to challenging problems with unknown search spaces...
  • cutgeneratingfunctionology

  • Referenced in 12 articles [sw31777]
  • computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem ... describe new computer-based search strategies for extreme functions for the Gomory-Johnson infinite group...
  • ParMoonolith

  • Referenced in 16 articles [sw42382]
  • projection. It includes a parallel search strategy, output dependent load balancing, and the computation...
  • PatternHunter

  • Referenced in 36 articles [sw20963]
  • studies routinely depend on homology searches based on the strategy of finding short seed matches ... growth presents a dilemma for DNA homology search techniques: increasing seed size decreases sensitivity whereas...
  • EasyLocal++

  • Referenced in 39 articles [sw04104]
  • invariant parts of various search algorithms, and the ”Strategy Method”, for the communication between...
  • HIBISCUS

  • Referenced in 14 articles [sw31090]
  • presents a constraint programming model and search strategy to formulate and solve staff scheduling problems ... describe a modular architecture for heuristic search. The resulting flexible and rather general constraint programming...