Sciweavers

1813 search results - page 23 / 363
» Instance Pruning Techniques
Sort
View
AAAI
2010
14 years 9 months ago
Exploiting QBF Duality on a Circuit Representation
Search based solvers for Quantified Boolean Formulas (QBF) have adapted the SAT solver techniques of unit propagation and clause learning to prune falsifying assignments. The tech...
Alexandra Goultiaeva, Fahiem Bacchus
COR
2006
98views more  COR 2006»
14 years 11 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
IJCAI
2007
15 years 1 months ago
Learning to Identify Unexpected Instances in the Test Set
Traditional classification involves building a classifier using labeled training examples from a set of predefined classes and then applying the classifier to classify test instan...
Xiaoli Li, Bing Liu, See-Kiong Ng
CPAIOR
2008
Springer
15 years 1 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
ICML
2003
IEEE
16 years 18 days ago
Relational Instance Based Regression for Relational Reinforcement Learning
Relational reinforcement learning (RRL) is a Q-learning technique which uses first order regression techniques to generalize the Qfunction. Both the relational setting and the Q-l...
Kurt Driessens, Jan Ramon