Multi-Population Genetic Algorithm for Locating Multi-Optima in Noisy Complex Landscape
- Author
- SZETO, K. Y1 ; YUNBO GUO1
[1] Department of Physics, The Hong Kong University of Science and Technology, Hong-Kong - Conference name
- International Conference on Applied Stochastic Models and Data Analysis (ASMDA) (ASMDA) (13 ; Vilnius 2009-06-30)
- Source
Communications in statistics. Theory and methods. 2011, Vol 40, Num 16-18, pp 3029-3048, 20 p ; ref : 1 p
- CODEN
- CSTMDC
- ISSN
- 0361-0926
- Scientific domain
- Mathematics
- Publisher
- Taylor & Francis, Philadelphia, PA
- Publication country
- United States
- Document type
- Conference Paper
- Language
- English
- Author keyword
- 65C50 68Wxx Landscape mapping Multi-agent system Parallel genetic algorithm Population dynamics
- Keyword (fr)
- Ajustement Algorithme génétique Algorithme parallèle Allocation ressource Analyse covariance Analyse variance Dynamique population Econométrie Environnement Estimation moyenne Fonction complexe Génétique population Moyenne Méthode statistique Performance algorithme Polynôme Régression statistique Sciences économiques Variance 60J70 62J10 62P12 62P20
- Keyword (en)
- Fitting Genetic algorithm Parallel algorithm Resource allocation Covariance analysis Variance analysis Population dynamics Econometrics Environment Mean estimation Complex function Population genetics Average Statistical method Algorithm performance Polynomial Statistical regression Economic sciences Variance
- Keyword (es)
- Ajuste Algoritmo genético Algoritmo paralelo Asignación recurso Análisis covariancia Análisis variancia Dinámica población Econometría Medio ambiente Estimación promedio Función compleja Genética población Promedio Método estadístico Resultado algoritmo Polinomio Regresión estadística Ciencias económicas Variancia
- Classification
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02H Probability and statistics / 001A02H01 Probability theory and stochastic processes / 001A02H01J Markov processes
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02H Probability and statistics / 001A02H02 Statistics / 001A02H02A General topics
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02H Probability and statistics / 001A02H02 Statistics / 001A02H02N Applications / 001A02H02N2 Insurance, economics, finance
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02H Probability and statistics / 001A02H02 Statistics / 001A02H02N Applications / 001A02H02N3 Biology, psychology, social sciences
- Discipline
- Mathematics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 24462194
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1080/03610926.2011.562789 
https://dx.doi.org/10.1080/03610926.2011.562789
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1080\/03610926.2011.562789\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:87:\"Multi-Population Genetic Algorithm for Locating Multi-Optima in Noisy Complex Landscape\";s:9:\"\u0000*\u0000jtitle\";s:48:\"Communications in statistics. Theory and methods\";s:9:\"\u0000*\u0000stitle\";s:29:\"Commun. stat., Theory methods\";s:7:\"\u0000*\u0000date\";s:4:\"2011\";s:9:\"\u0000*\u0000volume\";s:2:\"40\";s:8:\"\u0000*\u0000issue\";s:5:\"16-18\";s:8:\"\u0000*\u0000spage\";s:4:\"3029\";s:8:\"\u0000*\u0000epage\";s:4:\"3048\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0361-0926\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"SZETO\";s:10:\"\u0000*\u0000aufirst\";s:4:\"K. Y\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"YUNBO GUO\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CSTMDC\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:87:\"Multi-Population Genetic Algorithm for Locating Multi-Optima in Noisy Complex Landscape\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:16:\"Taylor & Francis\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"20\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1080\/03610926.2011.562789\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:87:\"Multi-Population Genetic Algorithm for Locating Multi-Optima in Noisy Complex Landscape\";s:9:\"\u0000*\u0000jtitle\";s:48:\"Communications in statistics. Theory and methods\";s:9:\"\u0000*\u0000stitle\";s:29:\"Commun. stat., Theory methods\";s:7:\"\u0000*\u0000date\";s:4:\"2011\";s:9:\"\u0000*\u0000volume\";s:2:\"40\";s:8:\"\u0000*\u0000issue\";s:5:\"16-18\";s:8:\"\u0000*\u0000spage\";s:4:\"3029\";s:8:\"\u0000*\u0000epage\";s:4:\"3048\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0361-0926\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"SZETO\";s:10:\"\u0000*\u0000aufirst\";s:4:\"K. Y\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"YUNBO GUO\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CSTMDC\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:87:\"Multi-Population Genetic Algorithm for Locating Multi-Optima in Noisy Complex Landscape\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:16:\"Taylor & Francis\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"20\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:28:\"10.1080\/03610926.2011.562789\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1080\/03610926.2011.562789\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:87:\"Multi-Population Genetic Algorithm for Locating Multi-Optima in Noisy Complex Landscape\";s:9:\"\u0000*\u0000jtitle\";s:48:\"Communications in statistics. Theory and methods\";s:9:\"\u0000*\u0000stitle\";s:29:\"Commun. stat., Theory methods\";s:7:\"\u0000*\u0000date\";s:4:\"2011\";s:9:\"\u0000*\u0000volume\";s:2:\"40\";s:8:\"\u0000*\u0000issue\";s:5:\"16-18\";s:8:\"\u0000*\u0000spage\";s:4:\"3029\";s:8:\"\u0000*\u0000epage\";s:4:\"3048\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0361-0926\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"SZETO\";s:10:\"\u0000*\u0000aufirst\";s:4:\"K. Y\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"YUNBO GUO\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CSTMDC\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:87:\"Multi-Population Genetic Algorithm for Locating Multi-Optima in Noisy Complex Landscape\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:16:\"Taylor & Francis\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"20\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1080\/03610926.2011.562789\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:87:\"Multi-Population Genetic Algorithm for Locating Multi-Optima in Noisy Complex Landscape\";s:9:\"\u0000*\u0000jtitle\";s:48:\"Communications in statistics. Theory and methods\";s:9:\"\u0000*\u0000stitle\";s:29:\"Commun. stat., Theory methods\";s:7:\"\u0000*\u0000date\";s:4:\"2011\";s:9:\"\u0000*\u0000volume\";s:2:\"40\";s:8:\"\u0000*\u0000issue\";s:5:\"16-18\";s:8:\"\u0000*\u0000spage\";s:4:\"3029\";s:8:\"\u0000*\u0000epage\";s:4:\"3048\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0361-0926\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"SZETO\";s:10:\"\u0000*\u0000aufirst\";s:4:\"K. Y\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"YUNBO GUO\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CSTMDC\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:87:\"Multi-Population Genetic Algorithm for Locating Multi-Optima in Noisy Complex Landscape\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:16:\"Taylor & Francis\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"20\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1080\/03610926.2011.562789\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:87:\"Multi-Population Genetic Algorithm for Locating Multi-Optima in Noisy Complex Landscape\";s:9:\"\u0000*\u0000jtitle\";s:48:\"Communications in statistics. Theory and methods\";s:9:\"\u0000*\u0000stitle\";s:29:\"Commun. stat., Theory methods\";s:7:\"\u0000*\u0000date\";s:4:\"2011\";s:9:\"\u0000*\u0000volume\";s:2:\"40\";s:8:\"\u0000*\u0000issue\";s:5:\"16-18\";s:8:\"\u0000*\u0000spage\";s:4:\"3029\";s:8:\"\u0000*\u0000epage\";s:4:\"3048\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0361-0926\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"SZETO\";s:10:\"\u0000*\u0000aufirst\";s:4:\"K. Y\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"YUNBO GUO\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CSTMDC\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:87:\"Multi-Population Genetic Algorithm for Locating Multi-Optima in Noisy Complex Landscape\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:16:\"Taylor & Francis\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"20\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
