Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks (Q881799): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q57551191, #quickstatements; #temporary_batch_1710286847436 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57551191 / rank | |||
Normal rank | |||
Revision as of 01:45, 13 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks |
scientific article |
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
