✦ LIBER ✦

Bounds for probability of success of classical genetic algorithm based on hamming distance

✍ Scribed by Shiu Yin Yuen; Cheung, B.K.S.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The optimization of success probability

✍ Francisco Reyes; Narciso Cerpa; Alfredo Candia-Véjar; Matthew Bardeen 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 552 KB

A distance-based cluster algorithm for g

✍ Yi Tu, Weidong Mao 📂 Article 📅 2012 🏛 International Association of Scientists in the Int 🌐 English ⚖ 267 KB

Upper and Lower Bounds for Probability o

✍ Robert Longworth Smith and Robert P. Charrow 📂 Article 📅 1975 🏛 American Statistical Association 🌐 English ⚖ 929 KB

Mutation probability of cytochrome P450

✍ Yu Yao; Tao Zhang; Yi Xiong; Li Li; Juan Huo; Professor Dong-Qing Wei 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB

On the Decoder Error Probability of Boun

✍ Gadouleau, M.; Zhiyuan Yan 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 225 KB

A new probability decoding scheme based

✍ Jian-guo Yuan 袁建国, Lin Wang 王琳, Qing-ping He 何清萍, Hao Li 李好, Yong Wang 王永 📂 Article 📅 2012 🏛 Tianjin University of Technology 🌐 English ⚖ 200 KB