Sciweavers

4670 search results - page 78 / 934
» Testing that distributions are close
Sort
View
ISSTA
2006
ACM
15 years 4 months ago
Path-oriented random testing
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
Arnaud Gotlieb, Matthieu Petit
ATS
2001
IEEE
126views Hardware» more  ATS 2001»
15 years 1 months ago
Design of an Optimal Test Access Architecture Using a Genetic Algorithm
Test access is a major problem for core-based systemon-chip (SOC) designs. Since cores in an SOC are not directly accessible via chip inputs and outputs, special access mechanisms...
Zahra Sadat Ebadi, André Ivanov
IPPS
2006
IEEE
15 years 4 months ago
Fault injection in distributed Java applications
In a network consisting of several thousands computers, the occurrence of faults is unavoidable. Being able to test the behaviour of a distributed program in an environment where ...
William Hoarau, Sébastien Tixeuil, Fabien V...
MCU
1998
117views Hardware» more  MCU 1998»
14 years 11 months ago
The Turing Closure of an Archimedean Field
A BSS machine is -uniform if it does not use exact tests; such machines are equivalent (modulo parameters) to Type 2 Turing machines. We define a notion of closure related to Turi...
Paolo Boldi, Sebastiano Vigna
IPSN
2003
Springer
15 years 3 months ago
Hypothesis Testing over Factorizations for Data Association
Abstract. The issue of data association arises frequently in sensor networks; whenever multiple sensors and sources are present, it may be necessary to determine which observations...
Alexander T. Ihler, John W. Fisher III, Alan S. Wi...