1941 search results - page 77 / 389 » On the Hardness of Approximate Reasoning |
114
click to vote
WORDS
2002
IEEE
15 years 4 months ago
2002
IEEE
Certainly, in hard real-time systems, it is reasonable to argue that no hard real-time threads should behave in an unpredictable way and that schedulability should be guaranteed b...
ECCV
2004
Springer
15 years 5 months ago
2004
Springer
Stochastic tracking of structured models in monolithic state spaces often requires modeling complex distributions that are difficult to represent with either parametric or sample...
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
FM
2006
Springer
15 years 3 months ago
2006
Springer
Symmetry reduction techniques can help to combat the state space explosion problem for model checking, but are restricted by the hard problem of determining equivalence of states d...
CADE
2004
Springer
16 years 6 days ago
2004
Springer
Sonic1 is the first prototype implementation of non-standard inferences for Description Logics usable via a graphical user interface. The contribution of our implementation is twof...