Sciweavers

AAAI
2008
15 years 8 months ago
Measuring the Hardness of SAT Instances
The search of a precise measure of what hardness of SAT instances means for state-of-the-art solvers is a relevant research question. Among others, the space complexity of treelik...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
AAAI
2007
15 years 8 months ago
Diagnosis of Discrete-Event Systems Using Satisfiability Algorithms
Alban Grastien, Anbulagan, Jussi Rintanen, Elena K...
AAAI
2008
15 years 8 months ago
Constrained Classification on Structured Data
Most standard learning algorithms, such as Logistic Regression (LR) and the Support Vector Machine (SVM), are designed to deal with i.i.d. (independent and identically distributed...
Chi-Hoon Lee, Matthew R. G. Brown, Russell Greiner...
AAAI
2007
15 years 8 months ago
Real-Time Identification of Operating Room State from Video
Beenish Bhatia, Tim Oates, Yan Xiao, Peter Fu-Ming...
AAAI
2008
15 years 8 months ago
Potential-based Shaping in Model-based Reinforcement Learning
Potential-based shaping was designed as a way of introducing background knowledge into model-free reinforcement-learning algorithms. By identifying states that are likely to have ...
John Asmuth, Michael L. Littman, Robert Zinkov