Sciweavers

650 search results - page 112 / 130
» On Coalgebras over Algebras
Sort
View
GECCO
2006
Springer
150views Optimization» more  GECCO 2006»
14 years 13 days ago
Nonlinear parametric regression in genetic programming
Genetic programming has been considered a promising approach for function approximation since it is possible to optimize both the functional form and the coefficients. However, it...
Yung-Keun Kwon, Sung-Soon Choi, Byung Ro Moon
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
14 years 11 days ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
14 years 10 days ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal
ICCAD
1995
IEEE
113views Hardware» more  ICCAD 1995»
14 years 10 days ago
Logic decomposition during technology mapping
—A problem in technology mapping is that the quality of the final implementation depends significantly on the initially provided circuit structure. This problem is critical, es...
Eric Lehman, Yosinori Watanabe, Joel Grodstein, He...
COCO
2008
Springer
118views Algorithms» more  COCO 2008»
13 years 10 months ago
Quantum Expanders: Motivation and Constructions
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma