✦ LIBER ✦

The general form of 0–1 programming problem based on DNA computing

✍ Scribed by Yin ZhiXiang; Zhang Fengyue; Xu Jin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving 0-1 Planning Problem Based on Se

✍ Huang, Yufang; Cheng, Zhen; Xu, Jin; Shi, Xiaolong; Zhou, Kang 📂 Article 📅 2010 🏛 American Scientific Publishers 🌐 English ⚖ 386 KB

A novel computing model of the maximum c

✍ Jing Yang; Cheng Zhang; Jin Xu; XiangRong Liu; XiaoLi Qiang 📂 Article 📅 2010 🏛 Science in China Press (SCP) 🌐 English ⚖ 503 KB

Similarity analysis of DNA sequences bas

✍ Chun Li; Jun Wang 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 74 KB

On the complexity of computing bilinear

✍ Teofilo Gonzalez; Joseph Ja'Ja' 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 903 KB

The effects of individually personalized

✍ Heng-Yu Ku; Christi A. Harter; Pei-Lin Liu; Ling Thompson; Yi-Chia Cheng 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 490 KB

On a Generalization of the 3x +&#xa

✍ G. Venturini 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 202 KB