✦ LIBER ✦

Research on cultural algorithm for solving routing problem of mobile agent

✍ Scribed by Jun MA; Jian-pei ZHANG; Jing YANG; Li-li CHENG

Book ID: 108484808
Publisher: Chinese Electronic Periodical Services
Year: 2008
Tongue: English
Weight: 231 KB
Volume: 15
Category: Article
ISSN: 1005-8885
DOI: 10.1016/s1005-8885(08)60415-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm based on mobile agent for d

An algorithm based on mobile agent for delay constrained least cost unicast routing

✍ Jin Xin; Liu Xian-de; Xiao Shi-yuan 📂 Article 📅 2005 🏛 Wuhan University 🌐 English ⚖ 388 KB

Research on immune genetic algorithm for

Research on immune genetic algorithm for solving the job-shop scheduling problem

✍ Xiao-dong Xu; Cong-xin Li 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 165 KB

On the efficiency of a modified local al

On the efficiency of a modified local algorithm for solving discrete optimization problems

✍ N.M. Kanaeva; O.A. Shcherbina 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 529 KB

Comments on “a decomposition algorithm f

Comments on “a decomposition algorithm for solving a class of optimal control problems”

✍ Thomas Pecsvaradi 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 142 KB

A nonlinear regularizing algorithm for s

A nonlinear regularizing algorithm for solving one class of inverse problems of heat conduction

✍ Yu. E. Voskoboinikov; A. V. Bronnikov 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 420 KB

ON THE CONVERGENCE OF ZERO-FINDING EIGEN

ON THE CONVERGENCE OF ZERO-FINDING EIGENSOLUTION ALGORITHMS FOR SOLVING NON-LINEAR EIGENVALUE PROBLEMS

✍ MOHAMMEDI R. ABDEL-AZIZ 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 2 views

This paper presents a convergence theory for non-linear eigenvalue methods. The basic idea of these methods, which have been described by the author in an earlier paper, 1 is to apply an eigen-solver in conjunction with a zero-ÿnding technique for solving the non-linear eigenvalue problems. The main