Referenced Items are not available for this document.
This paper presents a Hopfield (1986) neural network that solves the routing problem in communication network. It uses mean field annealing to eliminate the constraint terms in the energy function. Since there are no penalty parameters this approach should avoid the problems of scaling. Computer simulations of the neural network algorithm have shown that it can find optimal or near-optimal valid routes for all origin-destination pairs in a fourteen node communication network
Published in:
Communications, 1995. ICC '95 Seattle, 'Gateway to Globalization', 1995 IEEE International Conference on
(Volume:3
)
Date of Conference: 18-22 Jun 1995
- Page(s):
- 1602 - 1606 vol.3
- Meeting Date :
- 18 Jun 1995-22 Jun 1995
- Print ISBN:
- 0-7803-2486-2
- INSPEC Accession Number:
- 5211823
- Conference Location :
- Seattle, WA
- Digital Object Identifier :
- 10.1109/ICC.1995.524472
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
