Hill-climbing and branch-and-bound algorithms for exact and...

International Journal of Approximate Reasoning 2007 Vol. 44; Iss. 3

Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks

Andrés Cano, Manuel Gómez, Serafín Moral, Joaquín Abellán
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:
44
Year:
2007
Language:
english
Pages:
20
DOI:
10.1016/j.ijar.2006.07.020
File:
PDF, 399 KB
english, 2007
Conversion to is in progress
Conversion to is failed