Sciweavers

1047 search results - page 71 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
ACSW
2004
13 years 9 months ago
Applying Online Gradient Descent Search to Genetic Programming for Object Recognition
This paper describes an approach to the use of gradient descent search in genetic programming (GP) for object classification problems. In this approach, pixel statistics are used ...
William D. Smart, Mengjie Zhang
ECAI
2006
Springer
13 years 11 months ago
Efficient Knowledge Acquisition for Extracting Temporal Relations
Abstract. Machine learning approaches in natural language processing often require a large annotated corpus. We present a complementary approach that utilizes expert knowledge to o...
Son Bao Pham, Achim G. Hoffmann
GECCO
2006
Springer
185views Optimization» more  GECCO 2006»
13 years 11 months ago
Robot gaits evolved by combining genetic algorithms and binary hill climbing
In this paper an evolutionary algorithm is used for evolving gaits in a walking biped robot controller. The focus is fast learning in a real-time environment. An incremental appro...
Lena Mariann Garder, Mats Erling Høvin
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
13 years 11 months ago
Dominance learning in diploid genetic algorithms for dynamic optimization problems
This paper proposes an adaptive dominance mechanism for diploidy genetic algorithms in dynamic environments. In this scheme, the genotype to phenotype mapping in each gene locus i...
Shengxiang Yang
NAACL
2010
13 years 5 months ago
Tree Edit Models for Recognizing Textual Entailments, Paraphrases, and Answers to Questions
We describe tree edit models for representing sequences of tree transformations involving complex reordering phenomena and demonstrate that they offer a simple, intuitive, and eff...
Michael Heilman, Noah A. Smith