Login / Signup

A new algorithm for packet routing problems using chaotic neurodynamics and its surrogate analysis.

Takayuki KimuraTohru Ikeguchi
Published in: Neural Comput. Appl. (2007)
Keyphrases
  • learning algorithm
  • routing problem
  • computational complexity
  • dynamic programming
  • depth first search
  • objective function
  • optimal solution
  • cost function
  • neural network
  • search space
  • np hard