✦ LIBER ✦

Continuous and discretized pursuit learning schemes: various algorithms and their comparison

✍ Scribed by Oommen, B.J.; Agache, M.

Book ID: 117874671
Publisher: IEEE
Year: 2001
Tongue: English
Weight: 234 KB
Volume: 31
Category: Article
ISSN: 1083-4419
DOI: 10.1109/3477.931507

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized pursuit learning schemes: ne

Generalized pursuit learning schemes: new families of continuous and discretized learning automata

✍ Agache, M.; Oommen, B.J. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 866 KB

Nonlinear ergodic ε-optimal discretized

Nonlinear ergodic ε-optimal discretized reward-penalty learning automata and their application to adaptive routing algorithms

✍ Athanasios V. Vasilakos 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 806 KB

Experimental performance comparison for

Experimental performance comparison for various continuous-wave supercontinuum schemes: ring cavity and single pass structures

✍ Lee, Ju Han; Kikuchi, Kazuro 📂 Article 📅 2005 🏛 Optical Society of America 🌐 English ⚖ 212 KB

On tree types of competitive learning al

On tree types of competitive learning algorithms with their comparisons and applications to MRI segmentation

✍ Miin-Shen Yang; Kuo-Lung Wu; Karen Chia-Ren Lin; Hsiu-Chih Liu; Jiing-Feng Lirng 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 378 KB

This paper considers competitive learning networks using three types of hard, soft, and fuzzy learning schemes. The hard competitive learning algorithm is with the winner-take-all. The soft competition learning algorithm is with a stochastic relaxation technique using the Gibbs distribution as a dyn