1941 search results - page 56 / 389 » On the Hardness of Approximate Reasoning |
JMLR
2010
14 years 6 months ago
2010
We present a continuous time Bayesian network reasoning and learning engine (CTBN-RLE). A continuous time Bayesian network (CTBN) provides a compact (factored) description of a co...
184
click to vote
ICDE
1998
IEEE
16 years 1 months ago
1998
IEEE
Traditional Event-Condition-Action triggers (active database rules) include a Boolean predicate as a trigger condition. We propose fuzzy triggers whereby fuzzy inference is utiliz...
COMPSAC
2008
IEEE
15 years 6 months ago
2008
IEEE
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...
APIN
2005
14 years 11 months ago
2005
This paper presents an extension of Petri net framework with imprecise temporal properties. We use possibility theory to represent imprecise time by time-stamping tokens and assig...
150
click to vote
PSSE
2004
Springer
15 years 5 months ago
2004
Springer
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...