658 search results - page 74 / 132 » Slicing Methods Using Static and Dynamic Analysis Informatio... |
AUSAI
2005
Springer
15 years 5 months ago
2005
Springer
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
104
click to vote
HIPC
2003
Springer
15 years 5 months ago
2003
Springer
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/...
SAC
2005
ACM
15 years 5 months ago
2005
ACM
We present a novel indexing schema that provides eļ¬cient nearest-neighbor queries in multimedia databases consisting of objects described by multiple feature vectors. The beneļ¬...
EUROPAR
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. To analyze the correctness and the performance of a program, information about the dynamic behavior of all participating processes is needed. The dynamic behavior can be ...
110
click to vote
IV
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--Dynamic recompilation tries to produce more efficient code by exploiting runtime information. Virtual machines like the Jikes RVM use recompilation heuristics to decide h...