Sciweavers

2531 search results - page 78 / 507
» Group testing in graphs
Sort
View
87
Voted
EUROPAR
2004
Springer
15 years 6 months ago
Evaluating OpenMP Performance Analysis Tools with the APART Test Suite
The APART working group is developing the APART Test Suite (ATS) for evaluating (automatic) performance analysis tools with respect to their correctness – that is, their ability...
Michael Gerndt, Bernd Mohr, Jesper Larsson Trä...
107
Voted
COMBINATORICS
1998
103views more  COMBINATORICS 1998»
15 years 11 days ago
Recognizing Circulant Graphs of Prime Order in Polynomial Time
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...
Mikhail E. Muzychuk, Gottfried Tinhofer
ICST
2010
IEEE
14 years 11 months ago
Repairing GUI Test Suites Using a Genetic Algorithm
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
Si Huang, Myra B. Cohen, Atif M. Memon
ICDE
2007
IEEE
122views Database» more  ICDE 2007»
16 years 2 months ago
Group Linkage
Poor quality data is prevalent in databases due to a variety of reasons, including transcription errors, lack of standards for recording database fields, etc. To be able to query ...
Byung-Won On, Nick Koudas, Dongwon Lee, Divesh Sri...
113
Voted
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
15 years 6 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia