Sciweavers

341 search results - page 14 / 69
» Learning to satisfy
Sort
View
JAIR
2006
106views more  JAIR 2006»
13 years 7 months ago
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable for...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...
JMLR
2006
113views more  JMLR 2006»
13 years 7 months ago
Learning the Structure of Linear Latent Variable Models
We describe anytime search procedures that (1) find disjoint subsets of recorded variables for which the members of each subset are d-separated by a single common unrecorded cause...
Ricardo Silva, Richard Scheines, Clark Glymour, Pe...
WIAS
2008
128views more  WIAS 2008»
13 years 7 months ago
Considering operational issues for multiagent conceptual inferencing in a distributed information retrieval application
Our system, based on a multiagent framework called collaborative understanding of distributed knowledge (CUDK), is designed with the overall goal of balancing agents' conceptu...
Leen-Kiat Soh
KDD
2004
ACM
187views Data Mining» more  KDD 2004»
14 years 7 months ago
IMMC: incremental maximum margin criterion
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or la...
Jun Yan, Benyu Zhang, Shuicheng Yan, Qiang Yang, H...
ECML
2001
Springer
13 years 12 months ago
Wrapping Web Information Providers by Transducer Induction
Modern agent and mediator systems communicate to a multitude of Web information providers to better satisfy user requests. They use wrappers to extract relevant information from HT...
Boris Chidlovskii