Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks (Q881799)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks |
scientific article; zbMATH DE number 5154704
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks |
scientific article; zbMATH DE number 5154704 |
Statements
Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks (English)
0 references
18 May 2007
0 references
credal network
0 references
probability intervals
0 references
Bayesian networks
0 references
strong independence
0 references
hill-climbing
0 references
branch-and-bound algorithms
0 references
