Sciweavers

2531 search results - page 45 / 507
» Group testing in graphs
Sort
View
COMBINATORICS
2002
116views more  COMBINATORICS 2002»
13 years 10 months ago
Toida's Conjecture is True
Let S be a subset of the units in Zn. Let be a circulant graph of order n (a Cayley graph of Zn) such that if ij E(), then i - j (mod n) S. Toida conjectured that if is another...
Edward Dobson, Joy Morris
INFOCOM
2008
IEEE
14 years 5 months ago
Multicast Tree Diameter for Dynamic Distributed Interactive Applications
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
Knut-Helge Vik, Pål Halvorsen, Carsten Griwo...
FORTEST
2008
14 years 5 days ago
Model-Based Testing of Object-Oriented Reactive Systems with Spec Explorer
Testing is one of the costliest aspects of commercial software development. Model-based testing is a promising approach addressing these deficits. At Microsoft, model-based testin...
Margus Veanes, Colin Campbell, Wolfgang Grieskamp,...
FASE
2009
Springer
14 years 5 months ago
Reducing the Costs of Bounded-Exhaustive Testing
Abstract. Bounded-exhaustive testing is an automated testing methodology that checks the code under test for all inputs within given bounds: first the user describes a set of test...
Vilas Jagannath, Yun Young Lee, Brett Daniel, Dark...
AOSD
2008
ACM
14 years 20 days ago
AspectT: aspect-oriented test case instantiation
e instantiation is the transformation of abstract test cases cutable test scripts. Abstract test cases are either created during model based test case generation or are manually d...
Sebastian Benz