282 search results - page 2 / 57 » Probabilistic Timed Behavior Trees |
OOPSLA
2007
Springer
13 years 11 months ago
2007
Springer
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
AI
2010
Springer
13 years 5 months ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
KR
1998
Springer
13 years 9 months ago
1998
Springer
We study the problem of probabilistic deduction with conditional constraints over basic events. We show that globallycomplete probabilistic deduction with conditional constraints ...
EMSOFT
2009
Springer
14 years 2 days ago
2009
Springer
In this paper, we propose a formal analysis approach to estimate the expected (average) data cache access time of an application across all possible program inputs. Towards this g...
RP
2010
Springer
13 years 3 months ago
2010
Springer
We aim at finding a set of timing parameters for which a given timed automaton has a “good” behavior. We present here a novel approach based on the decomposition of the parame...