Cooperative annealing Hopfield network for unconstrained binary quadratic programming problem

► This paper first proposes an annealing HNN (AHNN) that permits temporary energy ascent to help the HNN escape from local minima. ► From a cooperative perspective, a population of the AHNN processes are then simultaneously implemented and coupled by their acceptance probabilities. ► The proposed Co...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Expert systems with applications Ročník 38; číslo 11; s. 13894 - 13905
Hlavní autori:	Zhou, Ying, Wang, Jiahai, Yin, Jian
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.10.2011
Predmet:	Algorithms Annealing Annealing Hopfield neural network Combinatorial analysis Combinatorial optimization problem Computer simulation Cooperative search Maximum cut problem Minima Networks Neural networks Quadratic programming Unconstrained binary quadratic programming problem Annealing Hopfield neural network Maximum cut problem Cooperative search Unconstrained binary quadratic programming problem Combinatorial optimization problem
ISSN:	0957-4174, 1873-6793
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!