On the diagnosing algorithm for networks.
Anton BiasizzoFranc NovakPublished in: Int. J. Comput. Math. (2000)
Keyphrases
- times faster
- computational cost
- computational complexity
- learning algorithm
- recognition algorithm
- data sets
- dynamic programming
- probabilistic model
- high accuracy
- detection algorithm
- improved algorithm
- memory requirements
- convex hull
- path planning
- single pass
- experimental study
- theoretical analysis
- np hard
- cost function
- k means
- search space
- input data
- simulated annealing
- worst case
- wireless networks
- classification algorithm
- experimental evaluation
- convergence rate
- optimal solution
- similarity measure