Sciweavers

627 search results - page 73 / 126
» The Laplace-Jaynes approach to induction
Sort
View
LPNMR
2005
Springer
15 years 4 months ago
An ID-Logic Formalization of the Composition of Autonomous Databases
We introduce a declarative approach for a coherent composition of autonomous databases. For this we use ID-logic, a formalism that extends classical logic with inductive definitio...
Bert Van Nuffelen, Ofer Arieli, Alvaro Corté...
AUSAI
2004
Springer
15 years 4 months ago
A Learning-Based Algorithm Selection Meta-reasoner for the Real-Time MPE Problem
Abstract. The algorithm selection problem aims to select the best algorithm for an input problem instance according to some characteristics of the instance. This paper presents a l...
Haipeng Guo, William H. Hsu
ILP
2004
Springer
15 years 4 months ago
First Order Random Forests with Complex Aggregates
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
Celine Vens, Anneleen Van Assche, Hendrik Blockeel...
PKDD
2004
Springer
102views Data Mining» more  PKDD 2004»
15 years 4 months ago
Improving the Performance of the RISE Algorithm
Ideally, a multi-strategy learning algorithm performs better than its component approaches. RISE is a multi-strategy algorithm that combines rule induction and instance-based learn...
Aloísio Carlos de Pina, Gerson Zaverucha
CAV
2003
Springer
156views Hardware» more  CAV 2003»
15 years 3 months ago
Abstraction and BDDs Complement SAT-Based BMC in DiVer
ion and BDDs Complement SAT-based BMC in DiVer Aarti Gupta1, Malay Ganai1 , Chao Wang2, Zijiang Yang1, Pranav Ashar1 1 NEC Laboratories America, Princeton, NJ, U.S.A. 2 University ...
Aarti Gupta, Malay K. Ganai, Chao Wang, Zijiang Ya...