Sciweavers

94 search results - page 4 / 19
» Detecting loop-carried dependences in programs with dynamic ...
Sort
View
GECCO
2010
Springer
338views Optimization» more  GECCO 2010»
13 years 7 months ago
Multiobjective evolutionary community detection for dynamic networks
A multiobjective genetic algorithm for detecting communities in dynamic networks, i.e., networks that evolve over time, is proposed. The approach leverages on the concept of evolu...
Francesco Folino, Clara Pizzuti
SIGSOFT
2005
ACM
14 years 9 months ago
Matching execution histories of program versions
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
Xiangyu Zhang, Rajiv Gupta
ICRA
2009
IEEE
141views Robotics» more  ICRA 2009»
14 years 3 months ago
Detecting repeated motion patterns via Dynamic Programming using motion density
— In this paper, we propose a method that detects repeated motion patterns in a long motion sequence efficiently. Repeated motion patterns are the structured information that ca...
Koichi Ogawara, Yasufumi Tanabe, Ryo Kurazume, Tsu...
ECOOP
2006
Springer
14 years 7 days ago
Demeter Interfaces: Adaptive Programming Without Surprises
Adaptive Programming (AP) allows for the separate definition of data structures and traversals with attached computations, performed during the traversal, that operate on these dat...
Therapon Skotiniotis, Jeffrey Palm, Karl J. Lieber...
SIGSOFT
1994
ACM
14 years 19 days ago
Speeding up Slicing
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genev...