3225 search results - page 169 / 645 » Compiling Experience into Knowledge |
135
click to vote
ECSQARU
1997
Springer
15 years 10 months ago
1997
Springer
Given a number of Dempster-Shafer belief functions there are different architectures which allow to do a compilation of the given knowledge. These architectures are the Shenoy-Sha...
164
click to vote
PEPM
1994
ACM
15 years 10 months ago
1994
ACM
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
133
click to vote
SAS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. It is often the case at runtime that variables and registers in programs are "quasi-invariant," i.e., the distribution of the values they take on is very skewed...
201
click to vote
AMAST
2008
Springer
15 years 8 months ago
2008
Springer
Several proof systems allow the formal verification of Java programs, and a specification language was specifically designed for Java. However, none of these systems support generi...
172
click to vote
BIS
2007
15 years 7 months ago
2007
Mailing list archives (i.e., the compilation of the messages posted up-to-now) are often published on the web and indexed by conventional search engines.They store a vast knowledg...