DMCA
Ordered valuation algebras: a generic framework for approximating inference (2004)
Cached
Download Links
- [www.iam.unibe.ch]
- [www.iam.unibe.ch]
- [www.uni-konstanz.de]
- DBLP
Other Repositories/Bibliography
by
Rolf Haenni
| Venue: | International Journal of Approximate Reasoning |
| Citations: | 18 - 1 self |
BibTeX
@ARTICLE{Haenni04orderedvaluation,
author = {Rolf Haenni},
title = {Ordered valuation algebras: a generic framework for approximating inference},
journal = {International Journal of Approximate Reasoning},
year = {2004},
pages = {1--41}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The paper presents a generic approach of approximating inference. The method is based on the concept of valuation algebras with its wide range of possible applications in many different domains. We present convenient resource-bounded anytime algorithms, where the maximal time of computation is determined by the user. Key words: Approximation, anytime algorithms, resource-bounded computation, valuation algebras, local computation, binary join trees, bucket elimination, mini-buckets. 1
