1241 search results - page 62 / 249 » Path-oriented random testing |
108
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
107
click to vote
EOR
2010
15 years 2 months ago
2010
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
115
click to vote
PRL
2007
15 years 1 months ago
2007
We present a method for initialising the K-means clustering algorithm. Our method hinges on the use of a kd-tree to perform a density estimation of the data at various locations. ...
162
click to vote
ECCC
2011
14 years 5 months ago
2011
The existence of optimal algorithms is not known for any decision problem in NP \ P. We consider the problem of testing the membership in the image of an injective function. We co...
111
Voted
WCE
2007
15 years 3 months ago
2007
—This paper presents one of the outcomes of a research project concerned with the development of a method for synthesizing, under controlled conditions in the laboratory, the ran...