A cognitive-inspired algorithm for growing networks.
Emanuele MassaroFranco BagnoliAndrea GuazziniHenrik OlssonPublished in: Nat. Comput. (2014)
Keyphrases
- dynamic programming
- times faster
- computational complexity
- path planning
- cost function
- np hard
- experimental evaluation
- optimal solution
- worst case
- computational cost
- computationally efficient
- probabilistic model
- detection algorithm
- theoretical analysis
- expectation maximization
- significant improvement
- k means
- preprocessing
- simulated annealing
- high accuracy
- optimization algorithm
- matching algorithm
- data structure