Sciweavers

336 search results - page 37 / 68
» Relevance heuristics for program analysis
Sort
View
PLDI
2005
ACM
14 years 1 months ago
Automatic pool allocation: improving performance by controlling data structure layout in the heap
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
Chris Lattner, Vikram S. Adve
CP
2007
Springer
14 years 1 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
GECCO
2007
Springer
213views Optimization» more  GECCO 2007»
13 years 11 months ago
Aspects of adaptation in natural and artificial evolution
This work addresses selected aspects of natural evolution, especially of the field of population genetics, that are considered to be meaningful for algorithmic further development...
Michael Affenzeller, Stefan Wagner 0002, Stephan M...
AAAI
1996
13 years 9 months ago
Knowledge-Based Navigation of Complex Information Spaces
While the explosion of on-line information has brought new opportunities for nding and using electronic data, it has also brought to the forefront the problem of isolating useful ...
Robin D. Burke, Kristian J. Hammond, Benjamin C. Y...
ISSTA
2012
ACM
11 years 10 months ago
Residual investigation: predictive and precise bug detection
We introduce the concept of “residual investigation” for program analysis. A residual investigation is a dynamic check installed as a result of running a static analysis that ...
Kaituo Li, Christoph Reichenbach, Christoph Csalln...