Sciweavers

430 search results - page 15 / 86
» Extracting Computer Algebra Programs from Statements
Sort
View
CAV
2007
Springer
104views Hardware» more  CAV 2007»
15 years 11 months ago
Revamping TVLA: Making Parametric Shape Analysis Competitive
Abstract. TVLA is a parametric framework for shape analysis that can be easily instantiated to create different kinds of analyzers for checking properties of programs that use link...
Igor Bogudlov, Tal Lev-Ami, Thomas W. Reps, Mooly ...
DAC
1996
ACM
15 years 9 months ago
A Parallel Precorrected FFT Based Capacitance Extraction Program for Signal Integrity Analysis
In order to optimize interconnect to avoid signal integrity problems, very fast and accurate 3-D capacitance extraction is essential. Fast algorithms, such as the multipole or prec...
Narayan R. Aluru, V. B. Nadkarni, James White
CEC
2008
IEEE
15 years 11 months ago
Policy evolution with Genetic Programming: A comparison of three approaches
— In the early days a policy was a set of simple rules with a clear intuitive motivation that could be formalised to good effect. However the world is now much more complex. Subt...
Yow Tzu Lim, Pau-Chen Cheng, John Andrew Clark, Pa...
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
15 years 11 months ago
Characterizing the genetic programming environment for fifth (GPE5) on a high performance computing cluster
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
Kenneth Holladay
HPCA
2007
IEEE
16 years 5 months ago
Exploiting Postdominance for Speculative Parallelization
Task-selection policies are critical to the performance of any architecture that uses speculation to extract parallel tasks from a sequential thread. This paper demonstrates that ...
Mayank Agarwal, Kshitiz Malik, Kevin M. Woley, Sam...