Utilize este identificador para referenciar este registo: http://hdl.handle.net/10451/14147
Título: A Neural Network for Shortest Path Computation
Autor: Araújo, Filipe
Ribeiro, Bernardete
Rodrigues, Luís
Palavras-chave: Neural Networks
Combinatorial Optimization Problems
Shortest Path Problem
Hopfield Neural Networks
Data: Abr-2000
Editora: Department of Informatics, University of Lisbon
Relatório da Série N.º: di-fcul-tr-00-2
Resumo: This paper presents a new neural network to solve the shortest path problem for internetwork routing. The proposed solution extends the traditional single-layer recurrent Hopfield architecture introducing a two-layer architecture that automatically guarantees an entire set of constraints held by any valid solution to the shortest path problem. This new method addresses some of the limitations of previous solutions, in particular the lack of reliability in what concerns succeeded and valid convergence. Experimental results show that a clear improvement in well-succeeded convergence can be achieved. Additionally, computation performance is also improved at the expense of slightly worse results
URI: http://hdl.handle.net/10451/14147
Aparece nas colecções:FC-DI - Technical Reports

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
00-2.pdf147,58 kBAdobe PDFVer/Abrir

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.