Title of article :
Approximate belief updating in max-2-connected Bayes networks is NP-hard Original Research Article
Author/Authors :
Erez Karpas، نويسنده , , Solomon Eyal Shimony، نويسنده , , Amos Beimel، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2009
Pages :
4
From page :
1150
To page :
1153
Abstract :
A max-2-connected Bayes network is one where there are at most 2 distinct directed paths between any two nodes. We show that even for this restricted topology, null-evidence belief updating is hard to approximate.
Keywords :
Complexity , Max-k-connected , Bayes network
Journal title :
Artificial Intelligence
Serial Year :
2009
Journal title :
Artificial Intelligence
Record number :
1207700
Link To Document :
بازگشت