IJCAI 2007
Abstract
In this paper we propose the Dynamic Weighting A* (DWA*) search algorithm for solving MAP problems in Bayesian networks. By exploiting asymmetries in the distribution of MAP variables, the algorithm is able to greatly reduce the search space and offer excellent performance both in terms of accuracy and efficiency.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- International Joint Conference on Artificial Intelligence
- Archive span
- 1969-2025
- Indexed papers
- 14525
- Paper id
- 1129084033323689731