163 search results - page 24 / 33 » An Introduction to Probabilistic Automata |
RP
2010
Springer
13 years 6 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...
JCSS
2008
13 years 7 months ago
2008
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
TCS
2011
13 years 2 months ago
2011
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification" of the local rule of a corresponding Boolean cellula...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Estimating the illumination and the reflectance properties
of an object surface from a sparse set of images is an
important but inherently ill-posed problem. The problem
becomes...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...