1618 search results - page 44 / 324 » Testing random number generators |
RSA
2008
13 years 9 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
CHI
2005
ACM
14 years 10 months ago
2005
ACM
Software systems are often complex in the number of features that are available through the user interface and consequently, the number of interactions that can occur. Such system...
KDD
2003
ACM
14 years 10 months ago
2003
ACM
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
ITC
1996
IEEE
14 years 2 months ago
1996
IEEE
This paper describes test generation for delay faults caused by global process disturbances. The structural and spatial correlation between path delays is used to reduce the numbe...
DATE
2003
IEEE
14 years 3 months ago
2003
IEEE
We investigate a characterization of hard-to-detect bridging faults. For circuits with large numbers of lines (or nodes), this characterization can be used to select target faults...