An algorithm for the computation of optimum designs under a given covariance structure.
Werner G. MüllerAndrej PázmanPublished in: Comput. Stat. (1999)
Keyphrases
- experimental evaluation
- matching algorithm
- dynamic programming
- computational complexity
- np hard
- memory requirements
- k means
- significant improvement
- tree structure
- times faster
- computational cost
- preprocessing
- convergence rate
- recognition algorithm
- optimal solution
- learning algorithm
- linear programming
- computationally efficient
- optimization algorithm
- detection algorithm
- graph structure
- neural network
- efficient computation
- clustering method
- segmentation algorithm
- high accuracy
- cost function
- search algorithm
- data structure
- reinforcement learning
- genetic algorithm