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

Andrés Cano et al. (2007)

> Home

Details and statistics

DOI: 10.1016/J.IJAR.2006.07.020

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ijar/CanoGMA07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijar/CanoGMA07
Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral, Joaquín Abellán:
Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks. Int. J. Approx. Reason. 44(3): 261-280 (2007)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.