Sciweavers

3736 search results - page 111 / 748
» Generative Programming
Sort
View
ICASSP
2009
IEEE
15 years 6 months ago
Generating high performance pruned FFT implementations
We derive a recursive general-radix pruned Cooley-Tukey fast Fourier transform (FFT) algorithm in Kronecker product notation. The algorithm is compatible with vectorization and pa...
Franz Franchetti, Markus Püschel
CCO
2001
Springer
256views Combinatorics» more  CCO 2001»
15 years 7 months ago
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms
In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on p...
Alexander Martin
LCPC
2005
Springer
15 years 8 months ago
A Language for the Compact Representation of Multiple Program Versions
Abstract. As processor complexity increases compilers tend to deliver suboptimal performance. Library generators such as ATLAS, FFTW and SPIRAL overcome this issue by empirically s...
Sébastien Donadio, James C. Brodman, Thomas...
ESCIENCE
2005
IEEE
15 years 8 months ago
A Distributed Problem Solving Environment (PSE) for Scientific Computing
A distributed Problem Solving Environment (PSE) is proposed to help users solve partial differential equation (PDE) based problems in scientific computing. The system inputs a pro...
Shigeo Kawata, Hideaki Fuju, Hideaki Sugiura, Yuic...
KBSE
2006
IEEE
15 years 8 months ago
Automatic Generation of Detection Algorithms for Design Defects
Maintenance is recognised as the most difficult and expansive activity of the software development process. Numerous techniques and processes have been proposed to ease the mainte...
Naouel Moha, Yann-Gaël Guéhéneu...