1725 search results - page 158 / 345 » Relaxed genetic programming |
4OR
2006
14 years 10 months ago
2006
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
EMNLP
2010
14 years 8 months ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
EUROGP
2008
Springer
15 years 12 days ago
2008
Springer
Many automatically-synthesized programs have, like their hand-made counterparts, numerical parameters that need to be set properly before they can show an acceptable performance. H...
85
Voted
FLAIRS
2004
15 years 1 days ago
2004
Modeling human behavior can be complicated and expensive. To be able to reduce costs, new methodologies and tools must be developed that automate the creation of human behavior mo...
CEC
2010
IEEE
14 years 11 months ago
2010
IEEE
At the current state of the art, genetic programs do not contain two constructs that commonly occur in programs written by humans, that is, loops and functions with parameters. In ...