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 the normal view instead:
scientific article; zbMATH DE number 5154704
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8917165994644165
0 references
0.8331091403961182
0 references
0.8205341100692749
0 references
0.8157671689987183
0 references
0.8104478716850281
0 references
