Sciweavers

255 search results - page 20 / 51
» Synthesis of Functions Using Generic Programming
Sort
View
ICFP
2006
ACM
14 years 7 months ago
An object-oriented approach to datatype-generic programming
Datatype-generic programming (DGP) is the next step beyond abstracting over types using parametric polymorphism, which is often called "genericity" in object-oriented la...
Adriaan Moors, Frank Piessens, Wouter Joosen
POPL
2007
ACM
14 years 8 months ago
Geometry of synthesis: a structured approach to VLSI design
We propose a new technique for hardware synthesis from higherorder functional languages with imperative features based on Reynolds's Syntactic Control of Interference. The re...
Dan R. Ghica
ASIACRYPT
2008
Springer
13 years 9 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
13 years 11 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
14 years 1 months ago
Solving real-valued optimisation problems using cartesian genetic programming
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
James Alfred Walker, Julian Francis Miller