R-FRTDP: A Real-Time DP Algorithm with Tight Bounds for a Stochastic Resource Allocation Problem.
Camille BessePierrick PlamondonBrahim Chaib-draaPublished in: Canadian Conference on AI (2007)
Keyphrases
- tight bounds
- dynamic programming
- real time
- learning algorithm
- monte carlo
- preprocessing
- times faster
- detection algorithm
- search space
- optimal solution
- recognition algorithm
- theoretical analysis
- cost function
- np hard
- computational cost
- selection algorithm
- convergence rate
- convex hull
- optimization algorithm
- high accuracy
- upper bound
- experimental evaluation
- computationally efficient
- expectation maximization
- segmentation algorithm
- worst case
- ant colony optimization
- tree structure
- search algorithm
- multi objective
- state space
- significant improvement
- parallel implementation
- artificial neural networks