975 search results - page 74 / 195 » Locality Optimization for Program Instances |
GECCO
2010
Springer
15 years 1 months ago
2010
Springer
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
109
click to vote
IEEEPACT
2009
IEEE
14 years 7 months ago
2009
IEEE
As the gap between processor and memory continues to grow, memory performance becomes a key performance bottleneck for many applications. Compilers therefore increasingly seek to m...
JAIR
2008
14 years 9 months ago
2008
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
108
click to vote
CC
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Profiling can effectively analyze program behavior and provide critical information for feedback-directed or dynamic optimizations. Based on memory profiling, reuse dista...
WEA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...