A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration.
Tarik HadzicHenrik Reif AndersenPublished in: AAAI (2006)
Keyphrases
- detection algorithm
- np hard
- learning algorithm
- computational cost
- dynamic programming
- improved algorithm
- times faster
- optimization algorithm
- experimental evaluation
- k means
- computational complexity
- computationally efficient
- cost function
- data sets
- particle swarm optimization
- objective function
- neural network
- optimal solution
- convergence rate
- memory requirements
- convex hull
- path planning
- matching algorithm
- input data
- simulated annealing
- preprocessing
- significant improvement