The complexity of approximating MAPs for belief networks with bounded probabilities

Authors:
Ashraf M. Abdelbar;Stephen T. Hedetniemi;Sandra M. Hedetniemi
Affiliations:
American Univ. in Cairo, Cairo, Egypt;Clemson Univ., Celmson, SC;Clemson Univ., Celmson, SC
Venue:
Artificial Intelligence
Year:
2000

Citing 0
Cited 2

Complexity results for explanations in the structural-model approach

Artificial Intelligence
Finding most probable explanations using a self-adaptive hybridization of genetic algorithms and simulated annealing

ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract