Sciweavers

1127 search results - page 50 / 226
» Testing the Expansion of a Graph
Sort
View
AGTIVE
1999
Springer
14 years 3 months ago
DiTo - A Distribution Tool Based on Graph Rewriting
Abstract. In the paper Support for Design Patterns through Graph Transformation Tools in this volume, we have already outlined the global structure of a tool that allows for the an...
Ansgar Radermacher
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
14 years 8 months ago
Randomization Techniques for Graphs.
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
ISSTA
2006
ACM
14 years 5 months ago
Towards regression test selection for AspectJ programs
Regression testing aims at showing that code has not been adversely affected by modification activities during maintenance. Regression test selection techniques reuse tests from...
Jianjun Zhao, Tao Xie, Nan Li
ORL
2006
103views more  ORL 2006»
13 years 11 months ago
Reduction tests for the prize-collecting Steiner problem
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
Eduardo Uchoa
VLSID
2002
IEEE
98views VLSI» more  VLSID 2002»
14 years 11 months ago
On Test Scheduling for Core-Based SOCs
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
Sandeep Koranne