Sciweavers

6943 search results - page 887 / 1389
» Representations for evolutionary algorithms
Sort
View
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
16 years 17 days ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
16 years 17 days ago
A generator for hierarchical problems
We describe a generator for hierarchical problems called the Hierarchical Problem Generator (HPG). Hierarchical problems are of interest since they constitute a class of problems ...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
16 years 16 days ago
Generalized normal forms and polynomial system solving
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Bernard Mourrain
PAKDD
2005
ACM
96views Data Mining» more  PAKDD 2005»
16 years 16 days ago
Kernels over Relational Algebra Structures
Abstract. In this paper we present a novel and general framework based on concepts of relational algebra for kernel-based learning over relational schema. We exploit the notion of ...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
PKC
2005
Springer
109views Cryptology» more  PKC 2005»
16 years 16 days ago
Fast Multi-computations with Integer Similarity Strategy
Abstract. Multi-computations in finite groups, such as multiexponentiations and multi-scalar multiplications, are very important in ElGamallike public key cryptosystems. Algorithm...
Wu-Chuan Yang, Dah-Jyh Guan, Chi-Sung Laih