Sciweavers

2774 search results - page 329 / 555
» Query-Driven Program Testing
Sort
View
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 6 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
106
Voted
ASWEC
2008
IEEE
15 years 4 months ago
Root Cause Analysis Using Sequence Alignment and Latent Semantic Indexing
Automatic identification of software faults has enormous practical significance. This requires characterizing program execution behavior. Equally important is the aspect of diagno...
R. P. Jagadeesh Chandra Bose, U. Suresh
CSR
2008
Springer
15 years 3 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma
BIOCOMP
2008
15 years 3 months ago
Identifying Protein Flexibility by NMA
- Here proposed apriori method for identification of protein flexibility relies on one end-state conformation of the protein. This method has comparative advantage over many others...
Kresimir Sikic, Branko Jeren, Sanja Tomic
ICWS
2010
IEEE
15 years 3 months ago
Script-Based Generation of Dynamic Testbeds for SOA
This paper addresses one of the major problems of SOA software development: the lack of support for testing complex service-oriented systems. The research community has developed v...
Lukasz Juszczyk, Schahram Dustdar