Zobrazeno 1 - 10
of 56
pro vyhledávání: '"Defining length"'
Autor:
Zahra Zojaji, Mohammad Mehdi Ebadzadeh
Publikováno v:
Soft Computing. 22:3237-3260
A considerable research effort has been performed recently to improve the power of genetic programming (GP) by accommodating semantic awareness. The semantics of a tree implies its behavior during the execution. A reliable theoretical modeling of GP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7b69ebfcd3c1d0d89db9ec60970cf1b
https://doi.org/10.1007/s00500-017-2781-6
https://doi.org/10.1007/s00500-017-2781-6
Autor:
Apoorva Mishra, Anupam Shukla
Publikováno v:
Soft Computing. 22:1763-1771
Genetic algorithms are widely used in the field of optimization. Schema theory forms the foundational basis for the success of genetic algorithms. Traditional genetic algorithms involve only a single mutation phase per iteration of the algorithm. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7981a61ca9402ae61142ab230e7c307a
https://doi.org/10.1007/s00500-017-2650-3
https://doi.org/10.1007/s00500-017-2650-3
Publikováno v:
International Journal of Security and Its Applications. 10:87-94
Schema theorem is the theoretical foundation of the evolutionary algorithm. This paper focuses on a new, and general schema theory for multigenic chromosomes gene expression programming. The theory is applicable to every operator in GEP via the metho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::438a779fbb3c947251d95d105078c63e
https://doi.org/10.14257/ijsia.2016.10.1.09
https://doi.org/10.14257/ijsia.2016.10.1.09
Autor:
Mohammad Mehdi Ebadzadeh, Zahra Zojaji
Publikováno v:
Applied Intelligence. 44:67-87
Schema theory is the most well-known model of evolutionary algorithms. Imitating from genetic algorithms (GA), nearly all schemata defined for genetic programming (GP) refer to a set of points in the search space that share some syntactic characteris
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2f3274c7ea29ef19c3439f087ad3fb5
https://doi.org/10.1007/s10489-015-0696-4
https://doi.org/10.1007/s10489-015-0696-4
Autor:
Yen-Sheng Chen
Publikováno v:
International Journal of Antennas and Propagation, Vol 2015 (2015)
This paper proposes a new design technique for internal antenna development. The proposed method is based on the framework of topology optimization incorporated with three effective mechanisms favoring the building blocks of associated optimization p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11775489fafe5e7d91c4bd77120143f2
https://doi.org/10.1155/2015/206243
https://doi.org/10.1155/2015/206243
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Data & Knowledge Engineering. 68:728-747
Schema matching is a critical step for discovering semantic correspondences among elements in many data-shared applications. Most of existing schema matching algorithms produce scores between schema elements resulting in discovering only simple match
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::340044f4d55522248ae2b5ad941ad760
https://doi.org/10.1016/j.datak.2009.01.001
https://doi.org/10.1016/j.datak.2009.01.001
Autor:
Jeremy G. W. Chin, N. C. Sahoo
Publikováno v:
Computer Applications in Engineering Education. 18:434-448
Evolutionary search is a global search method based on natural selection. In engineering curriculum, these techniques are taught in courses like Evolutionary Computation, Engineering Optimization, etc. Genetic algorithm (GA) is popular among these al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5236b80db8c53753afbcb3a61a060233
https://doi.org/10.1002/cae.20165
https://doi.org/10.1002/cae.20165
Autor:
Jin-rong Xu
Publikováno v:
Journal of Computer Applications. 28:275-278
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3975832e1abf1a8c5b89c8f4e573a77
https://doi.org/10.3724/sp.j.1087.2008.00275
https://doi.org/10.3724/sp.j.1087.2008.00275
Publikováno v:
Evolutionary Computation. 12:461-493
In a previous paper (Rowe et al., 2002), aspects of the theory of genetic algorithms were generalised to the case where the search space, Ω, had an arbitrary group action defined on it. Conditions under which genetic operators respect certain subset
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6669fd640689fa2b06e26a8bdabdfa7
https://doi.org/10.1162/1063656043138941
https://doi.org/10.1162/1063656043138941