1725 search results - page 146 / 345 » Relaxed genetic programming |
103
click to vote
EMNLP
2010
14 years 8 months ago
2010
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...
SAC
2004
ACM
15 years 4 months ago
2004
ACM
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
SODA
2010
ACM
15 years 8 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
GECCO
2005
Springer
15 years 4 months ago
2005
Springer
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...
CEC
2010
IEEE
14 years 12 months ago
2010
IEEE
Rather than attempting to evolve a complete program from scratch we demonstrate genetic interface programming (GIP) by automatically generating a parallel CUDA kernel with identica...