Sciweavers

941 search results - page 36 / 189
» Efficient Testing of Large Graphs
Sort
View
ITC
1993
IEEE
148views Hardware» more  ITC 1993»
15 years 1 months ago
DELTEST: Deterministic Test Generation for Gate-Delay Faults
This paper presents an efficient approach to generate tests for gate delay faults. Unlike other known algorithms which try to generate a 'good' delay test the presented ...
Udo Mahlstedt
SIGIR
2011
ACM
14 years 15 days ago
Pseudo test collections for learning web search ranking functions
Test collections are the primary drivers of progress in information retrieval. They provide a yardstick for assessing the effectiveness of ranking functions in an automatic, rapi...
Nima Asadi, Donald Metzler, Tamer Elsayed, Jimmy L...
94
Voted
ATAL
2009
Springer
15 years 4 months ago
Graph-based methods for the analysis of large-scale multiagent systems
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
Wilbur Peng, William Krueger, Alexander Grushin, P...
AINA
2004
IEEE
15 years 1 months ago
Parallel PageRank Computation on a Gigabit PC Cluster
Efficient computing the PageRank scores for a large web graph is actually one of the hot issues in Web-IR community. Recent researches propose to accelerate the computation, both ...
Bundit Manaskasemsak, Arnon Rungsawang
SEW
2006
IEEE
15 years 3 months ago
Pseudo-Exhaustive Testing for Software
Pseudo-exhaustive testing uses the empirical observation that, for broad classes of software, a fault is likely triggered by only a few variables interacting. The method takes adv...
D. Richard Kuhn, Vadim Okun