Article

Mixing in Genetic Algorithms

Authors:

Dirk Thierens,

David E. GoldbergAuthors Info & Claims

Proceedings of the 5th International Conference on Genetic Algorithms

Pages 38 - 47

Published: 01 June 1993 Publication History

Abstract

No abstract available.

Cited By

View all

Dushatskiy AAlderliesten TBosman P(2021)A Novel Approach to Designing Surrogate-assisted Genetic Algorithms by Combining Efficient Learning of Walsh Coefficients and DependenciesACM Transactions on Evolutionary Learning and Optimization10.1145/34531411:2(1-23)Online publication date: 29-Jul-2021
https://dl.acm.org/doi/10.1145/3453141
Tung YYu TEsparcia-Alcázar A(2015)Theoretical Perspective of Convergence Complexity of Evolutionary Algorithms Adopting Optimal MixingProceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation10.1145/2739480.2754685(535-542)Online publication date: 11-Jul-2015
https://dl.acm.org/doi/10.1145/2739480.2754685
Luong NGrond MLa Poutré HBosman PArnold D(2014)Efficiency enhancements for evolutionary capacity planning in distribution gridsProceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation10.1145/2598394.2605696(1189-1196)Online publication date: 12-Jul-2014
https://dl.acm.org/doi/10.1145/2598394.2605696
Show More Cited By

Mixing in Genetic Algorithms

Recommendations

A robust blind sparse source separation algorithm using genetic algorithm to identify mixing matrix
SPPR'07: Proceedings of the Fourth conference on IASTED International Conference: Signal Processing, Pattern Recognition, and Applications

In this paper, a novel identification of mixing matrix using genetic algorithm (GA) is proposed to deal with the blind sparse source separation (BSS) problem. A preprocessing filters the most of minor mixtures at first, and then represents the remainder ...
Optimizing blind source separation with guided genetic algorithms

This paper proposes a novel method for blindly separating unobservable independent component (IC) signals based on the use of a genetic algorithm. It is intended for its application to the problem of blind source separation (BSS) on post-nonlinear ...
A robust blind sparse source separation algorithm using genetic algorithm to identify mixing matrix
SPPRA '07: Proceedings of the Fourth IASTED International Conference on Signal Processing, Pattern Recognition, and Applications

In this paper, a novel identification of mixing matrix using genetic algorithm (GA) is proposed to deal with the blind sparse source separation (BSS) problem. A preprocessing filters the most of minor mixtures at first, and then represents the remainder ...

Comments

Information & Contributors

Information

Published In

Proceedings of the 5th International Conference on Genetic Algorithms

June 1993

624 pages

ISBN:1558602992

Editor:
Stephanie Forrest

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 01 June 1993

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

45
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dushatskiy AAlderliesten TBosman P(2021)A Novel Approach to Designing Surrogate-assisted Genetic Algorithms by Combining Efficient Learning of Walsh Coefficients and DependenciesACM Transactions on Evolutionary Learning and Optimization10.1145/34531411:2(1-23)Online publication date: 29-Jul-2021
https://dl.acm.org/doi/10.1145/3453141
Tung YYu TEsparcia-Alcázar A(2015)Theoretical Perspective of Convergence Complexity of Evolutionary Algorithms Adopting Optimal MixingProceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation10.1145/2739480.2754685(535-542)Online publication date: 11-Jul-2015
https://dl.acm.org/doi/10.1145/2739480.2754685
Luong NGrond MLa Poutré HBosman PArnold D(2014)Efficiency enhancements for evolutionary capacity planning in distribution gridsProceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation10.1145/2598394.2605696(1189-1196)Online publication date: 12-Jul-2014
https://dl.acm.org/doi/10.1145/2598394.2605696
Hamano KOhnishi KKöppen M(2014)Evolution of Developmental Timing for Solving Hierarchically Dependent Deceptive ProblemsProceedings of the 10th International Conference on Simulated Evolution and Learning - Volume 888610.1007/978-3-319-13563-2_6(58-69)Online publication date: 15-Dec-2014
https://dl.acm.org/doi/10.1007/978-3-319-13563-2_6
Hsu PYu TAlba E(2013)A niching scheme for EDAs to reduce spurious dependenciesProceedings of the 15th annual conference on Genetic and evolutionary computation10.1145/2463372.2463421(375-382)Online publication date: 6-Jul-2013
https://dl.acm.org/doi/10.1145/2463372.2463421
Bosman PThierens DAlba E(2013)More concise and robust linkage learning by filtering and combining linkage hierarchiesProceedings of the 15th annual conference on Genetic and evolutionary computation10.1145/2463372.2463420(359-366)Online publication date: 6-Jul-2013
https://dl.acm.org/doi/10.1145/2463372.2463420
Bosman PThierens DMoore J(2012)Linkage neighbors, optimal mixing and forced improvements in genetic algorithmsProceedings of the 14th annual conference on Genetic and evolutionary computation10.1145/2330163.2330247(585-592)Online publication date: 7-Jul-2012
https://dl.acm.org/doi/10.1145/2330163.2330247
Thierens DBosman PMoore J(2012)Predetermined versus learned linkage modelsProceedings of the 14th annual conference on Genetic and evolutionary computation10.1145/2330163.2330205(289-296)Online publication date: 7-Jul-2012
https://dl.acm.org/doi/10.1145/2330163.2330205
Chen WShao CHsu PYu TMoore J(2012)A test problem with adjustable degrees of overlap and conflict among subproblemsProceedings of the 14th annual conference on Genetic and evolutionary computation10.1145/2330163.2330201(257-264)Online publication date: 7-Jul-2012
https://dl.acm.org/doi/10.1145/2330163.2330201
Bosman PThierens DLanzi P(2011)The roles of local search, model building and optimal mixing in evolutionary algorithms from a bbo perspectiveProceedings of the 13th annual conference companion on Genetic and evolutionary computation10.1145/2001858.2002065(663-670)Online publication date: 12-Jul-2011
https://dl.acm.org/doi/10.1145/2001858.2002065
Show More Cited By

Abstract

Cited By

Recommendations

A robust blind sparse source separation algorithm using genetic algorithm to identify mixing matrix

Optimizing blind source separation with guided genetic algorithms

A robust blind sparse source separation algorithm using genetic algorithm to identify mixing matrix

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations