Yourim Yoon

Proceedings of the International Conference on Artificial Intelligence in Information and Communication , 2024

Efficient Pruning of DenseNet via a Surrogate-Model-Assisted Genetic Algorithm.

[BibT_eX]

[DOI]

Jingeun Kim

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2024

2023

Genetic Algorithm-based Feature Selection for Machine Learning System Diagnosing Sarcopenia with Survey Data.

[BibT_eX]

[DOI]

Jaehyeong Lee

Yoon Choi

Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

2022

Maximizing the Coverage of Sensor Deployments Using a Memetic Algorithm and Fast Coverage Estimation.

[BibT_eX]

[DOI]

IEEE Trans. Cybern., 2022

2020

Optimizing taxon addition order and branch lengths in the construction of phylogenetic trees using maximum likelihood.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2020

2019

A comparison study of harmony search and genetic algorithm for the max-cut problem.

[BibT_eX]

[DOI]

Zong Woo Geem

Swarm Evol. Comput., 2019

Investigation of incremental hybrid genetic algorithm with subgraph isomorphism problem.

[BibT_eX]

[DOI]

Swarm Evol. Comput., 2019

Genetic algorithm-based feature selection for depression scale prediction.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

2017

Coverage problem in camera-based sensor networks using the CUDA platform.

[BibT_eX]

[DOI]

Jae-Hyun Seo

Int. J. Distributed Sens. Networks, 2017

2016

An Efficient Large-Scale Sensor Deployment Using a Parallel Genetic Algorithm Based on CUDA.

[BibT_eX]

[DOI]

Jae-Hyun Seo

Int. J. Distributed Sens. Networks, 2016

Improved Correction of Atmospheric Pressure Data Obtained by Smartphones through Machine Learning.

[BibT_eX]

[DOI]

Comput. Intell. Neurosci., 2016

Solving Maximum Cut Problem with an Incremental Genetic Algorithm.

[BibT_eX]

[DOI]

Jinhyun Kim

Proceedings of the Genetic and Evolutionary Computation Conference, 2016

An NFC-based O2O service model in exhibition-space.

[BibT_eX]

[DOI]

Joon-Yeop Lee

Proceedings of the 18th Annual International Conference on Electronic Commerce, 2016

2015

Correcting Air-Pressure Data Collected by MEMS Sensors in Smartphones.

[BibT_eX]

[DOI]

J. Sensors, 2015

An Adeaptive Method of Hungarian Mating Schemes in Genetic Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

2014

Charge Scheduling of an Energy Storage System under Time-of-use Pricing and a Demand Charge.

[BibT_eX]

[DOI]

CoRR, 2014

Investigation of hungarian mating schemes for genetic algorithms.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Applied Computing, 2014

2013

An Efficient Genetic Algorithm for Maximum Coverage Deployment in Wireless Sensor Networks.

[BibT_eX]

[DOI]

IEEE Trans. Cybern., 2013

Geometricity of genetic operators for real-coded representation.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2013

2012

Quotient geometric crossovers and redundant encodings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

A theoretical and empirical study on unbiased boundary-extended crossover for real-valued representation.

[BibT_eX]

[DOI]

Inf. Sci., 2012

A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2012

An efficient genetic algorithm for subgraph isomorphism.

[BibT_eX]

[DOI]

Jaeun Choi

Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011

A Note on Edge-based Graph Partitioning and its Linear Algebraic Structure.

[BibT_eX]

[DOI]

J. Math. Model. Algorithms, 2011

Geometric surrogate-based optimisation for permutation-based problems.

[BibT_eX]

[DOI]

Alberto Moraglio

Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

2010

New theoretical findings in multiple personalized recommendations.

[BibT_eX]

[DOI]

Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

Probabilistic context prediction using time-inferred multiple pattern networks.

[BibT_eX]

[DOI]

Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

2009

Mathematical Interpretation between Genotype and Phenotype Spaces and Induced Geometric Crossovers

[BibT_eX]

[DOI]

CoRR, 2009

A Mathematical Unification of Geometric Crossovers Defined on Phenotype Space

[BibT_eX]

[DOI]

CoRR, 2009

A Note on Mathematical Modelling of Practical Multicampaign Assignment and Its Computational Complexity

[BibT_eX]

[DOI]

CoRR, 2009

Representation and recombination over nonsingular binary matrices.

[BibT_eX]

[DOI]

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, 2009

Visualizing the search process of particle swarm optimization.

[BibT_eX]

[DOI]

Kang Hoon Lee

Proceedings of the Genetic and Evolutionary Computation Conference, 2009

A New Kernighan-Lin-Type Local Search for the Quadratic Assignment Problem.

[BibT_eX]

Proceedings of the 2009 International Conference on Scientific Computing, 2009

2008

A Lagrangian Approach for Multiple Personalized Campaigns.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2008

Effect of Changing the Basis in Genetic Algorithms Using Binary Encoding.

[BibT_eX]

[DOI]

KSII Trans. Internet Inf. Syst., 2008

Feasibility-preserving crossover for maximum k-coverage problem.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2008

2007

Geometric Crossovers for Multiway Graph Partitioning.

[BibT_eX]

[DOI]

Evol. Comput., 2007

Geometric crossovers for real-code representation.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2007

2006

Generalized cycle crossover for graph partitioning.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2006

Geometric crossover for multiway graph partitioning.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2006

2005

An evolutionary lagrangian method for the 0/1 multiple knapsack problem.

[BibT_eX]

[DOI]