A Neural Network for Shortest Path Computation
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...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | report |
| Idioma: | por |
| Publicado em: |
2009
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10451/14147 |
| País: | Portugal |
| Oai: | oai:repositorio.ul.pt:10451/14147 |