๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Resource Bounded Frequency Computations with

โœ Scribed by Ulrich Hertrampf; Christoph Minnameier

Publisher
Springer
Year
2009
Tongue
English
Weight
435 KB
Volume
56
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Resource bounded and anytime approximati
Resource bounded and anytime approximation of belief function computations
โœ Rolf Haenni; Norbert Lehmann ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 441 KB

This paper proposes a new approximation method for Dempster-Shafer belief functions. The method is based on a new concept of incomplete belief potentials. It allows to compute simultaneously lower and upper bounds for belief and plausibility. Furthermore, it can be used for a resource-bounded propag

Computational tradeoffs under bounded re
Computational tradeoffs under bounded resources
โœ Eric Horvitz; Shlomo Zilberstein ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 39 KB

Over the nearly fifty years of research in Artificial Intelligence, investigators have continued to highlight the computational hardness of implementing core competencies associated with intelligence. Key pillars of AI, including search, constraint propagation, belief updating, learning, decision ma

Resource bounded randomness and computat
Resource bounded randomness and computational complexity
โœ Yongge Wang ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 165 KB

The following is a survey of resource bounded randomness concepts and their relations to each other. Further, we introduce several new resource bounded randomness concepts corresponding to the classical randomness concepts, and show that the notion of polynomial time bounded Ko randomness is indepen

Frequency computation and bounded querie
Frequency computation and bounded queries
โœ Richard Beigel; William Gasarch; Efim Kinber ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1014 KB