3047 search results - page 335 / 610 » On the Meaning of Logical Completeness |
190
click to vote
IEAAIE
1999
Springer
15 years 11 months ago
1999
Springer
This paper presents a strategy to handle incomplete knowledge during acquisition process. The goal of this research is to develop formal tools that benefit the law of semantic bala...
203
click to vote
KDD
1999
ACM
15 years 11 months ago
1999
ACM
We propose to use AdaBoost to efficiently learn classifiers over very large and possibly distributed data sets that cannot fit into main memory, as well as on-line learning wher...
192
click to vote
FROCOS
2009
Springer
15 years 11 months ago
2009
Springer
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...
219
click to vote
ARCS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Certificate-based authentication of parties provides a powerful means for verifying claimed identities, since communicating partners do not have to exchange secrets in ad...
193
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
A c.e. real x is Solovay reducible to another c.e. real y if x can be approximated at least as efficiently as y by means of increasing computable sequences of rational numbers. The...