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

Probabilistic Algorithms for Efficient Grasping and Fixturing

โœ Scribed by M. Teichmann; B. Mishra

Publisher
Springer
Year
2000
Tongue
English
Weight
180 KB
Volume
26
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On metrics for probabilistic systems: De
On metrics for probabilistic systems: Definitions and algorithms
โœ Taolue Chen; Tingting Han; Jian Lu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 538 KB

In this paper, we consider the behavioral pseudometrics for probabilistic systems, which are a quantitative analogue of probabilistic bisimilarity in the sense that the distance zero captures the probabilistic bisimilarity. The model we are interested in is probabilistic automata, which are based on

Fast quantum algorithms for handling pro
Fast quantum algorithms for handling probabilistic and interval uncertainty
โœ Vladik Kreinovich; Luc Longprรฉ ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 182 KB

## Abstract In many realโ€life situations, we are interested in the value of a physical quantity __y__ that is difficult or impossible to measure directly. To estimate __y__, we find some easierโ€toโ€measure quantities __x__~1~, โ€ฆ , __x~n~__ which are related to __y__ by a known relation __y__ = __f__