3068 search results - page 385 / 614 » Clustering with Multiple Graphs |
197
Voted
NOMS
2002
IEEE
15 years 11 months ago
2002
IEEE
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
153
click to vote
WCRE
1993
IEEE
15 years 10 months ago
1993
IEEE
Recognizing commonly used data structures and algorithms is a key activity in reverse engineering. Systems developed to automate this recognition process have been isolated, stand...
211
click to vote
FCCM
2009
IEEE
15 years 10 months ago
2009
IEEE
Scheduling and partitioning of task graphs on reconfigurable hardware needs to be carefully carried out in order to achieve the best possible performance. In this paper, we demons...
170
click to vote
CATA
2003
15 years 8 months ago
2003
In this paper we present a new method of combining multiple precedence constraints for a single task to support software systems having client-server relationships. In these types...
201
click to vote
DAGSTUHL
1996
15 years 8 months ago
1996
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...