✦ LIBER ✦

An improved optimal competitive Hopfield network for bipartite subgraph problems

✍ Scribed by Jiahai Wang; Zheng Tang

Book ID: 113813853
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 198 KB
Volume: 61
Category: Article
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2004.03.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved discrete Hopfield neural net

An improved discrete Hopfield neural network for Max-Cut problems

✍ Jiahai Wang 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 170 KB

An efficient algorithm for solving optim

An efficient algorithm for solving optimization problems on Hopfield-type neural networks

✍ Toshio Tanaka; Tetsuya Higuchi; Tatsumi Furuya 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 828 KB

## Abstract When solving optimization problems on Hopfield neural networks, good solutions are not obtained due to convergence to local minima of the energy function. The Boltzmann machine can escape from local minima because of its stochastic behavior, but the computation time is very long to reac

An improved ant colony optimization for

An improved ant colony optimization for the communication network routing problem

✍ Dongming Zhao; Liang Luo; Kai Zhang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 308 KB

Ant colony optimization (ACO) is a population-based meta-heuristic for combinatorial optimization problems such as the communication network routing problem (CNRP). This paper proposes an improved ant colony optimization (IACO) technique, which adapts a new strategy to update the increased pheromone