
GOLEM
 Referenced in 52 articles
[sw24695]
 GOLEM chooses the one which covers the largest number of positive examples and is consistent...

MPTP 0.2
 Referenced in 45 articles
[sw02589]
 TPTP syntax, allowing a number of ATP experiments. This covers, for example, consistent handling ... prooflocal lemmas and translating of a number of Mizar proof constructs into the TPTP...

AETG
 Referenced in 61 articles
[sw09715]
 combinatorial algorithms to generate test sets that cover all valid nway parameter combinations ... AETG test set grows logarithmically in the number of test parameters. This allows testers...

PROMPT
 Referenced in 9 articles
[sw09801]
 large number of ontologies covering overlapping domains. In order for these ontologies to be reused...

AnchorPROMPT
 Referenced in 8 articles
[sw09802]
 large number of ontologies covering overlapping domains, which researchers now need to merge or align...

CLOS
 Referenced in 51 articles
[sw03334]
 classes and methods. CLOS contains a number of complex and powerful features ... basic parts of CLOS, which will be covered here, include pretty much everything...

PathCrawler
 Referenced in 10 articles
[sw07253]
 defined limit on the number of loop iterations in the covered paths. The prototype treats ... structures of variable dimensions, loops with variable numbers of iterations and many infeasible paths. PathCrawler...

RealPaver
 Referenced in 50 articles
[sw04401]
 satisfaction and optimization problems over the real numbers. The decision variables, continuous or discrete, have ... operations and transcendental elementary functions. Rigourousness: Realpaver covers the solution set of a given problem...

TINA
 Referenced in 44 articles
[sw03280]
 tool Tina proposes the construction of a number of representations for the behaviour of Petri ... called partial order techniques such as covering steps and/or persistent sets. For Time Petri nets...

LYAPACK
 Referenced in 61 articles
[sw12624]
 last few years, quite a number of approaches for several types of large control problems ... software package LYAPACK (“Lyapunov Package”), which covers one particular approach to a class of large...

ADST
 Referenced in 3 articles
[sw02441]
 messages, where k is the number of servers covering the query range. Moreover, our structure...

PARSEC
 Referenced in 26 articles
[sw09610]
 performance computing applications and used a limited number of synchronization methods. PARSEC includes emerging applications ... characterization shows that the benchmark suite covers a wide spectrum of working sets, locality, data...

GiD
 Referenced in 55 articles
[sw07799]
 engineering. It has been designed to cover all the common needs in the numerical simulations ... read and write data in an unlimited number of formats. GiD’s input and output...

Matterport3D
 Referenced in 3 articles
[sw38209]
 algorithms. However, existing datasets still cover only a limited number of views or a restricted...

DifferentialEquations.jl
 Referenced in 35 articles
[sw23910]
 solving differential equations in Julia. It covers discrete equations (function maps, discrete stochastic (Gillespie/Markov) simulations ... solvers, such as allowing arbitrary userdefined number systems for highprecision and arithmetic with...

MOVE
 Referenced in 3 articles
[sw02550]
 process consists of a number of independent optimization schemes that cover various aspects...

nparACT
 Referenced in 1 article
[sw15696]
 value for a userdefined number of minutes. IS describes the strength of coupling ... reliable results, actigraphy data should cover a reasonable number of days...

iLocHum
 Referenced in 36 articles
[sw22433]
 Actually, recent evidence has indicated an increasing number of human proteins having multiple subcellular locations ... benchmark dataset of human proteins that covers the following 14 location sites: centrosome, cytoplasm, cytoskeleton...

GUIHDMR
 Referenced in 22 articles
[sw07924]
 complex model with a large number of input parameters. Furthermore, variance based sensitivity indices ... This guarantees that the input space is covered more uniformly than by using random values...

FastFDs
 Referenced in 11 articles
[sw01613]
 efficient solutions have exponential complexity in the number of attributes of the instance. We develop ... heuristicdriven (DFHD) search for finding minimal covers of hypergraphs. The technique of reducing...