Sciweavers

13 search results - page 2 / 3
» A deterministic density algorithm for pairwise interaction c...
Sort
View
ICSE
2005
IEEE-ACM
14 years 5 months ago
A framework of greedy methods for constructing interaction test suites
Greedy algorithms for the construction of software interaction test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one ...
Charles J. Colbourn, Myra B. Cohen, Renée C...
RECOMB
2006
Springer
14 years 5 months ago
Integrated Protein Interaction Networks for 11 Microbes
We have combined four different types of functional genomic data to create high coverage protein interaction networks for 11 microbes. Our integration algorithm naturally handles s...
Balaji S. Srinivasan, Antal F. Novak, Jason Flanni...
WDAG
2007
Springer
92views Algorithms» more  WDAG 2007»
13 years 11 months ago
Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
Abstract. Distributed computing must adapt its techniques to networks of mobile agents. Indeed, we are facing new problems like the small size of memory and the lack of computation...
Joffroy Beauquier, Julien Clement, Stéphane...
JPDC
2006
187views more  JPDC 2006»
13 years 4 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
Fei Dai, Jie Wu
GLVLSI
2005
IEEE
118views VLSI» more  GLVLSI 2005»
13 years 10 months ago
High-diagnosability online built-in self-test of FPGAs via iterative bootstrapping
We develop a novel on-line built-in self-test (BIST) technique for testing FPGAs that has a very high diagnosability even in presence of clustered faults, a fault pattern for whic...
Vishal Suthar, Shantanu Dutt