Sciweavers

175 search results - page 24 / 35
» Test Case Prioritization: A Family of Empirical Studies
Sort
View
ECCC
2008
122views more  ECCC 2008»
14 years 11 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira
FPGA
2000
ACM
114views FPGA» more  FPGA 2000»
15 years 3 months ago
Generating highly-routable sparse crossbars for PLDs
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
Guy G. Lemieux, Paul Leventis, David M. Lewis
APPROX
2011
Springer
284views Algorithms» more  APPROX 2011»
13 years 11 months ago
On Approximating the Number of Relevant Variables in a Function
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
Dana Ron, Gilad Tsur
WOSP
2004
ACM
15 years 5 months ago
Early performance testing of distributed software applications
Performance characteristics, such as response time, throughput and scalability, are key quality attributes of distributed applications. Current practice, however, rarely applies s...
Giovanni Denaro, Andrea Polini, Wolfgang Emmerich
SIGSOFT
2008
ACM
16 years 14 days ago
Profile-guided program simplification for effective testing and analysis
Many testing and analysis techniques have been developed for inhouse use. Although they are effective at discovering defects before a program is deployed, these techniques are oft...
Lingxiao Jiang, Zhendong Su