1097 search results - page 169 / 220 » Boosting with incomplete information |
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
EDBTW
2006
Springer
15 years 1 months ago
2006
Springer
One of the goals of cleaning an inconsistent database is to remove conflicts between tuples. Typically, the user specifies how the conflicts should be resolved. Sometimes this spec...
AIIA
2003
Springer
15 years 1 months ago
2003
Springer
The aim of this paper is to show how abduction can be used in classification tasks when we deal with incomplete data. Some classifiers, even if based on decision tree induction lik...
CARDIS
2000
Springer
15 years 1 months ago
2000
Springer
This paper reports on an effort to increase the reliability of JavaCard-based smart cards by means of formal specification and verification of JavaCard source code. As a first ste...
ICALP
1998
Springer
15 years 1 months ago
1998
Springer
An architecture is described for designing systems that acquire and manipulate large amounts of unsystematized, or so-called commonsense, knowledge. Its aim is to exploit to the fu...