Dense and Switched Modular Primitives for Bond Graph Model Design

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

@InProceedings{seo4:2003:gecco,
  author =       "Kisung Seo and Zhun Fan and Jianjun Hu and 
                 Erik D. Goodman and Ronald C. Rosenberg",
  title =        "Dense and Switched Modular Primitives for Bond Graph
                 Model Design",
  booktitle =    "Genetic and Evolutionary Computation -- GECCO-2003",
  editor =       "E. Cant{\'u}-Paz and J. A. Foster and K. Deb and 
                 D. Davis and R. Roy and U.-M. O'Reilly and H.-G. Beyer and 
                 R. Standish and G. Kendall and S. Wilson and 
                 M. Harman and J. Wegener and D. Dasgupta and M. A. Potter and 
                 A. C. Schultz and K. Dowsland and N. Jonoska and 
                 J. Miller",
  year =         "2003",
  pages =        "1764--1775",
  address =      "Chicago",
  publisher_address = "Berlin",
  month =        "12-16 " # jul,
  volume =       "2724",
  series =       "LNCS",
  ISBN =         "3-540-40603-4",
  publisher =    "Springer-Verlag",
  keywords =     "genetic algorithms, genetic programming",
  URL =          "http://garage.cse.msu.edu/papers/GARAGe03-07-03.pdf",
  DOI =          "doi:10.1007/3-540-45110-2_68",
  abstract =     "suggests dense and switched modular primitives for a
                 bond-graph-based GP design framework that automatically
                 synthesizes designs for multi-domain, lumped parameter
                 dynamic systems. A set of primitives is sought that
                 will avoid redundant junctions and elements, based on
                 pre-assembling useful functional blocks of bond graph
                 elements and (optionally) using a switched choice
                 mechanism for inclusion of some elements. Motivation
                 for using these primitives is to improve performance
                 through greater search efficiency and thereby to reduce
                 computational effort. As a proof of concept for this
                 approach, an eigenvalue assignment problem, which is to
                 find bond graph models exhibiting minimal distance
                 errors from target sets of eigenvalues, was tested and
                 showed improved performance for various sets of
                 eigenvalues.",
  notes =        "GECCO-2003. A joint meeting of the twelfth
                 International Conference on Genetic Algorithms
                 (ICGA-2003) and the eighth Annual Genetic Programming
                 Conference (GP-2003)",
}

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

Citations