Mathematical software

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...

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

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...

AnyDBC
Referenced in 2 articles [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...

CABOB