• CABOB

  • Referenced in 31 articles [sw17813]
  • instance distribution. Experiments against the fastest prior algorithm, CPLEX 8.0, show that CABOB is often ... linear space and has significantly better anytime performance than CPLEX...
  • IDB-ADOPT

  • Referenced in 2 articles [sw02746]
  • ADOPT is an asynchronous and distributed search algorithm that is able to solve DCOP problems ... solution. Thus, IDB-ADOPT is an anytime algorithm that solves DCOP problems with integer costs...
  • DESPOT

  • Referenced in 4 articles [sw27455]
  • this result, we give an anytime online planning algorithm, which searches a DESPOT...
  • AnyDBC

  • Referenced in 1 article [sw29968]
  • AnyDBC: An Efficient Anytime Density-based Clustering Algorithm for Very Large Complex Datasets. The density ... based clustering algorithm DBSCAN is a state-of-the-art data clustering technique with numerous ... this paper, we propose a novel anytime approach to cope with this problem by reducing ... label propagation time of DBSCAN. Our algorithm, called AnyDBC, compresses the data into smaller density...
  • LPG

  • Referenced in 12 articles [sw20690]
  • more criteria. This is achieved by an anytime process producing a sequence of plans, each ... integrated with a best-first algorithm similar to the one used by FF. The system...
  • Paramils

  • Referenced in 70 articles [sw00678]
  • Paramils: an automatic algorithm configuration framework. The identification...
  • TSPLIB

  • Referenced in 665 articles [sw00983]
  • TSPLIB is a library of sample instances for...
  • SCIP

  • Referenced in 472 articles [sw01091]
  • SCIP is currently one of the fastest non...
  • DBSCAN

  • Referenced in 4 articles [sw02921]
  • Experiments in parallel clustering with DBSCAN. We present...
  • UCI-ml

  • Referenced in 3100 articles [sw04074]
  • UC Irvine Machine Learning Repository. We currently maintain...
  • Walksat

  • Referenced in 208 articles [sw04328]
  • GSAT and WalkSat are local search algorithms to...
  • Concorde

  • Referenced in 303 articles [sw04770]
  • Concorde is a computer code for the symmetric...
  • Choco

  • Referenced in 62 articles [sw06254]
  • CHOCO is a java library for constraint satisfaction...
  • SATzilla

  • Referenced in 86 articles [sw06281]
  • SATzilla: portfolio-based algorithm selection for SAT. It...
  • SPOT

  • Referenced in 79 articles [sw06347]
  • SPOT: Sequential Parameter Optimization , R-Package for Sequential...
  • LibDAI

  • Referenced in 15 articles [sw06422]
  • LibDAI: a free and open source C++ library...
  • ToulBar2

  • Referenced in 22 articles [sw07289]
  • Toulbar2 is an exact discrete optimization c++ open...