A new variant of the A-algorithm which closes a node at most once.
Sukhamay KunduPublished in: Ann. Math. Artif. Intell. (1991)
Keyphrases
- cost function
- learning algorithm
- optimal solution
- computational complexity
- detection algorithm
- preprocessing
- high accuracy
- worst case
- selection algorithm
- optimization algorithm
- k means
- matching algorithm
- times faster
- convex hull
- recognition algorithm
- graph structure
- improved algorithm
- np hard
- computational cost
- data sets
- significant improvement
- particle swarm optimization
- search space
- tree structure
- objective function