Bond Graph Representation and GP for Automated Analog Filter Design

Created by W.Langdon from gp-bibliography.bib Revision:1.3973

@InProceedings{fan:2001:bgrgaafd,
  author =       "Zhun Fan and Jianjun Hu and Kisung Seo and 
                 Erik D. Goodman and Ronald C. Rosenberg and Baihai Zhang",
  title =        "Bond Graph Representation and {GP} for Automated
                 Analog Filter Design",
  booktitle =    "2001 Genetic and Evolutionary Computation Conference
                 Late Breaking Papers",
  year =         "2001",
  editor =       "Erik D. Goodman",
  pages =        "81--86",
  address =      "San Francisco, California, USA",
  month =        "9-11 " # jul,
  email =        "fanzhun@egr.msu.edu, hujianju@egr.msu.edu",
  keywords =     "genetic algorithms, genetic programming, STGP, bond
                 graphs, evolutionary synthesis",
  URL =          "http://citeseer.ist.psu.edu/448346.html",
  abstract =     "We present a novel circuit representation scheme,
                 namely bond graph, along with strong-typed genetic
                 programming for the evolution of analog filter
                 circuits. Bond graph is a concise and uniform language
                 for the description of circuit systems and more general
                 engineering systems. Many unique characteristics of
                 bond graph makes it an attractive candidate for
                 representing circuit in genetic programming design. The
                 feasibility and efficiency of using bond graph as the
                 representation technique of circuit systems are
                 verified in our experiments with automated analogue
                 filter design.",
  notes =        "GECCO-2001LB, lilgp",
}

Genetic Programming entries for Zhun Fan Jianjun Hu Kisung Seo Erik Goodman Ronald C Rosenberg Baihai Zhang

Citations