Sciweavers

141 search results - page 3 / 29
» Destruction of Very Simple Trees
Sort
View
GECCO
2007
Springer
175views Optimization» more  GECCO 2007»
13 years 12 months ago
On the constructiveness of context-aware crossover
Crossover in Genetic Programming is mostly a destructive operator, generally producing children worse than the parents and occasionally producing those who are better. A recently ...
Hammad Majeed, Conor Ryan
GECCO
2007
Springer
236views Optimization» more  GECCO 2007»
13 years 12 months ago
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
Quan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Lia...
FPCA
1989
13 years 9 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori
EACL
2006
ACL Anthology
13 years 7 months ago
Making Tree Kernels Practical for Natural Language Learning
In recent years tree kernels have been proposed for the automatic learning of natural language applications. Unfortunately, they show (a) an inherent super linear complexity and (...
Alessandro Moschitti
DAM
2007
63views more  DAM 2007»
13 years 5 months ago
Attacking a public key cryptosystem based on tree replacement
We point out several security flaws in the cryptosystem based on tree replacement systems proposed by Samuel, Thomas, Abisha and Subramanian at INDOCRYPT 2002. Due to the success...
Maria Isabel Gonzalez Vasco, David Pérez-Ga...