Updating credal networks is approximable in polynomial time

Updating credal networks is approximable in polynomial time

Denis D. Mauá, Cassio P. de Campos, Marco Zaffalon
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
53
Year:
2012
Language:
english
DOI:
10.1016/j.ijar.2012.06.014
File:
PDF, 540 KB
english, 2012
Conversion to is in progress
Conversion to is failed