670 search results - page 39 / 134 » Inclusion-Based Approximate Reasoning |
POPL
2010
ACM
14 years 5 months ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
VMCAI
2007
Springer
14 years 1 months ago
2007
Springer
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
SDM
2008
SIAM
13 years 9 months ago
2008
SIAM
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
FLAIRS
2004
13 years 9 months ago
2004
The issue of fire propagation in cities is of obvious importance to Civil Authorities, but does present issues of computational complexity. Our basic assumption is that some event...