Sciweavers

136 search results - page 7 / 28
» The Category Theoretic Solution of Recursive Program Schemes
Sort
View
212
Voted
POPL
2008
ACM
16 years 3 months ago
The design and implementation of typed scheme
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
Sam Tobin-Hochstadt, Matthias Felleisen
ICFP
2003
ACM
16 years 3 months ago
Iterative-free program analysis
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
15 years 4 months ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...
132
Voted
PPDP
2009
Springer
15 years 10 months ago
An Isabelle/HOL-based model of stratego-like traversal strategies
Traversal strategies are at the heart of transformational programming with rewriting-based frameworks such as Stratego/XT or Tom and specific approaches for generic functional pr...
Markus Kaiser, Ralf Lämmel
105
Voted
ACSC
2004
IEEE
15 years 7 months ago
On Improving the Memory Access Patterns During The Execution of Strassen's Matrix Multiplication Algorithm
Matrix multiplication is a basic computing operation. Whereas it is basic, it is also very expensive with a straight forward technique of O(N3 ) runtime complexity. More complex s...
Hossam A. ElGindy, George Ferizis