Sciweavers

536 search results - page 73 / 108
» A Translational Approach to Constraint Answer Set Solving
Sort
View
133
Voted
IJCAI
2003
15 years 5 months ago
Generalizing GraphPlan by Formulating Planning as a CSP
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
Adriana Lopez, Fahiem Bacchus
120
Voted
CIKM
2008
Springer
15 years 5 months ago
Proactive learning: cost-sensitive active learning with multiple imperfect oracles
Proactive learning is a generalization of active learning designed to relax unrealistic assumptions and thereby reach practical applications. Active learning seeks to select the m...
Pinar Donmez, Jaime G. Carbonell
115
Voted
SIGECOM
2004
ACM
120views ECommerce» more  SIGECOM 2004»
15 years 9 months ago
Computational criticisms of the revelation principle
The revelation principle is a cornerstone tool in mechanism design. It states that one can restrict attention, without loss in the designer’s objective, to mechanisms in which A...
Vincent Conitzer, Tuomas Sandholm
ICML
2009
IEEE
16 years 4 months ago
SimpleNPKL: simple non-parametric kernel learning
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
Jinfeng Zhuang, Ivor W. Tsang, Steven C. H. Hoi
141
Voted
ML
2002
ACM
127views Machine Learning» more  ML 2002»
15 years 3 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...