Sciweavers

4306 search results - page 113 / 862
» Timed Testing with TorX
Sort
View
RANDOM
1999
Springer
14 years 2 months ago
Fast Approximate PCPs for Multidimensional Bin-Packing Problems
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
Tugkan Batu, Ronitt Rubinfeld, Patrick White
ICSM
2005
IEEE
14 years 3 months ago
Test Suite Reduction with Selective Redundancy
Software testing is a critical part of software development. Test suite sizes may grow significantly with subsequent modifications to the software over time. Due to time and res...
Dennis Jeffrey, Neelam Gupta
BMCBI
2006
118views more  BMCBI 2006»
13 years 10 months ago
Identification of gene expression patterns using planned linear contrasts
Background: In gene networks, the timing of significant changes in the expression level of each gene may be the most critical information in time course expression profiles. With ...
Hao Li, Constance L. Wood, Yushu Liu, Thomas V. Ge...
MSS
1999
IEEE
150views Hardware» more  MSS 1999»
14 years 2 months ago
Performance Benchmark Results for Automated Tape Library High Retrieval Rate Applications - Digital Check Image Retrievals
Benchmark tests have been designed and conducted for the purpose of evaluating the use of automated tape libraries in on-line digital check image retrieval applications. This type...
John Gniewek, George Davidson, Bowen Caldwell
COCO
2004
Springer
86views Algorithms» more  COCO 2004»
14 years 3 months ago
Deterministic Polynomial Identity Testing in Non-Commutative Models
We give a deterministic polynomial time algorithm for polynomial identity testing in the following two cases:
Ran Raz, Amir Shpilka