BibSonomy :: user  :: brazovayeye ::

bookmarks

publications

(6)   

• Solving High-Order Boolean Parity Problems with Smooth Uniform Crossover, Sub-Machine Code GP and Demes
  Riccardo Poli and Jonathan Page Genetic Programming and Evolvable Machines1(1/2):37--56April2000.
  to parity problems programming, uniform subsymbolic genetic crossover, sub-machine-code representation, algorithms, gp, demes, by brazovayeye and 1 other person on Jun 19, 2008, 5:46 PM
  URL | BibTeX | spam 
• Using Domain Knowledge in Evolutionary System Identification
  Marc Schoenauer and Michele Sebag Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, Athens, 19-21 September2001.
  to problems programming, inverse genetic algorithms, by brazovayeye on Jun 19, 2008, 5:35 PM
  URL | BibTeX | spam 
• Recombination Guidance for Numerical Genetic Programming
  Hitoshi Iba and Taisuke Sato and Hugo de Garis 1995 IEEE Conference on Evolutionary Computation, 1, page97--102. Perth, Australia, IEEE Press, 29 November - 1 December1995.
  to computer series, series STROGANOFF, algorithm-based regression analysis statistical function time recombination, programming, search method, mechanism, algorithms, structured multiple problems, program, analysis, problems adaptive recombination chaotic prediction, system identification genetic program strategy, numerical representation, vision, fitting, estimation, nonlinear by brazovayeye on Jun 19, 2008, 5:35 PM
  BibTeX | spam 
• What Makes a Problem GP-Hard? A Look at How Structure Affects Content
  Jason M. Daida Genetic Programming Theory and Practice, chapter 7, Kluwer, (2003)
  to problems tree structures, programming, test difficulty, genetic GP-hard, GP problem algorithms, theory, by brazovayeye on Jun 19, 2008, 5:35 PM
  BibTeX | spam 
• Genetic Programming over Context-Free Languages with Linear Constraints for the Knapsack Problem: First Results
  Peter Bruhn and Andreas Geyer-Schulz Evolutionary Computation10(1):51--74Spring2002.
  to evolution, with genetic, linear problems grammar-based constraints, grammatical optimization, context-free grammars, knapsack programming, genetic algorithms, combinatorial, by brazovayeye and 1 other person on Jun 19, 2008, 5:35 PM
  URL | BibTeX | spam 
• Solving Approximation Problems by Ant Colony Programming
  Mariusz Boryczka and Zbigniew J. Czech Late Breaking Papers at the Genetic and Evolutionary Computation Conference (GECCO-2002), page39--46. New York, NY, AAAI, July2002.
  to problems programming, genetic colony automatic approximation algorithms, ant by brazovayeye and 3 other people on Jun 19, 2008, 5:35 PM
  URL | BibTeX | spam