TY - JOUR
T1 - An Analysis of Linear Ranking and Binary Tournament Selection in Genetic Algorithms
AU - Chakraborty, Mandira
AU - Chakraborty, Uday K.
N1 - The present paper extends the branching process model proposed by Chakraborty (1995) to cover linear ranking selection and binary tournament selection in g
PY - 1997/1/1
Y1 - 1997/1/1
N2 - The present paper extends the branching process model proposed by Chakraborty (1995) to cover linear ranking selection and binary tournament selection in genetic algorithms. Simulation results are presented.
AB - The present paper extends the branching process model proposed by Chakraborty (1995) to cover linear ranking selection and binary tournament selection in genetic algorithms. Simulation results are presented.
UR - http://ieeexplore.ieee.org/document/647128/
U2 - 10.1109/ICICS.1997.647128
DO - 10.1109/ICICS.1997.647128
M3 - Article
VL - 1
JO - International Conference on Information and Communication Security
JF - International Conference on Information and Communication Security
ER -