7335 search results - page 789 / 1467 » Scene Based Reasoning |
203
Voted
CADE
2009
Springer
16 years 8 months ago
2009
Springer
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...
210
click to vote
ECSQARU
2001
Springer
15 years 11 months ago
2001
Springer
New semantics for numerical values given to possibility measures are provided. For epistemic possibilities, the new approach is based on the semantics of the transferable belief m...
245
Voted
LICS
1997
IEEE
15 years 11 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
197
Voted
TIME
1994
IEEE
15 years 11 months ago
1994
IEEE
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
219
click to vote
EWCBR
2008
Springer
15 years 9 months ago
2008
Springer
To meet time constraints, a CBR system must control the time spent searching in the case base for a solution. In this paper, we presents the results of a case study comparing the p...