Sciweavers

2607 search results - page 177 / 522
» Complete Functional Synthesis
Sort
View
ITP
2010
156views Mathematics» more  ITP 2010»
15 years 8 months ago
The Optimal Fixed Point Combinator
In this paper, we develop a general theory of fixed point combinators, in higher-order logic equipped with Hilbert’s epsilon operator. This combinator allows for a direct and e...
Arthur Charguéraud
AML
2005
73views more  AML 2005»
15 years 3 months ago
Strong reducibility of partial numberings
A strong reducibility relation between partial numberings is introduced which is such that the reduction function transfers exactly the numbers which are indices under the numberin...
Dieter Spreen
DAC
2009
ACM
16 years 5 months ago
Nanoscale digital computation through percolation
In this study, we apply a novel synthesis technique for implementing robust digital computation in nanoscale lattices with random interconnects: percolation theory on random graph...
Mustafa Altun, Marc D. Riedel, Claudia Neuhauser
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
15 years 10 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
DAC
1997
ACM
15 years 8 months ago
A Parallel/Serial Trade-Off Methodology for Look-Up Table Based Decoders
A methodology for architecture exploration of look-up table based decoders is presented. For the degree of parallel processing a trade-off can be made by exploring system level an...
Claus Schneider