Sciweavers

1241 search results - page 138 / 249
» Path-oriented random testing
Sort
View
110
Voted
ICASSP
2008
IEEE
15 years 8 months ago
Compressive wireless arrays for bearing estimation
Joint processing of sensor array outputs improves the performance of parameter estimation and hypothesis testing problems beyond the sum of the individual sensor processing result...
Volkan Cevher, Ali Cafer Gurbuz, James H. McClella...
STORAGESS
2006
ACM
15 years 8 months ago
Using device diversity to protect data against batch-correlated disk failures
Batch-correlated failures result from the manifestation of a common defect in most, if not all, disk drives belonging to the same production batch. They are much less frequent tha...
Jehan-François Pâris, Darrell D. E. L...
IBPRIA
2005
Springer
15 years 8 months ago
Fast Surface Grading Using Color Statistics in the CIE Lab Space
In this paper we approach the problem of fast surface grading of flat pieces decorated with random patterns. The proposed method is based on the use of global statistics of color ...
Fernando López, José Miguel Valiente...
ILP
2004
Springer
15 years 7 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
127
Voted
LSSC
2001
Springer
15 years 6 months ago
A Quasi-Monte Carlo Method for Integration with Improved Convergence
Abstract. Quasi-Monte Carlo methods are based on the idea that random Monte Carlo techniques can often be improved by replacing the underlying source of random numbers with a more ...
Aneta Karaivanova, Ivan Dimov, Sofiya Ivanovska