Sciweavers

945 search results - page 107 / 189
» Graph Types
Sort
View
AOSD
2007
ACM
15 years 6 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
15 years 5 months ago
Scheduling with Bully Selfish Jobs
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
Tami Tamir
IPSN
2005
Springer
15 years 8 months ago
Coverage and hole-detection in sensor networks via homology
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
Robert Ghrist, Abubakr Muhammad
ISSTA
2006
ACM
15 years 8 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
ACTA
2005
87views more  ACTA 2005»
15 years 2 months ago
Hybrid networks of evolutionary processors are computationally complete
A hybrid network of evolutionary processors (an HNEP) consists of several language processors which are located in the nodes of a virtual graph and able to perform only one type o...
Erzsébet Csuhaj-Varjú, Carlos Mart&i...