Sciweavers

282 search results - page 18 / 57
» Probabilistic Timed Behavior Trees
Sort
View
HASE
1998
IEEE
13 years 11 months ago
Combining Various Solution Techniques for Dynamic Fault Tree Analysis of Computer Systems
Fault trees provide a graphical and logical framework for analyzing the reliability of systems. A fault tree provides a conceptually simple modeling framework to represent the sys...
Ragavan Manian, Joanne Bechta Dugan, David Coppit,...
ADC
2009
Springer
151views Database» more  ADC 2009»
13 years 11 months ago
Unified Q-ary Tree for RFID Tag Anti-Collision Resolution
Radio Frequency Identification (RFID) technology uses radio-frequency waves to automatically identify people or objects. A large volume of data, resulting from the fast capturing ...
Prapassara Pupunwiwat, Bela Stantic
UAI
1996
13 years 8 months ago
An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
Yousri El Fattah, Rina Dechter
ICTAI
2003
IEEE
14 years 23 days ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
ISQED
2006
IEEE
116views Hardware» more  ISQED 2006»
14 years 1 months ago
Probabilistic Delay Budgeting for Soft Realtime Applications
Unlike their hard realtime counterparts, soft realtime applications are only expected to guarantee their ”expected delay” over input data space. This paradigm shift calls for ...
Soheil Ghiasi, Po-Kuan Huang