Sciweavers

1930 search results - page 227 / 386
» Learning to Solve QBF
Sort
View
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
14 years 1 months ago
Overcoming hierarchical difficulty by hill-climbing the building block structure
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
David Iclanzan, Dan Dumitrescu
AIPS
2008
13 years 11 months ago
The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
Katrina Ray, Matthew L. Ginsberg
AAAI
2010
13 years 10 months ago
Collaborative Expert Portfolio Management
We consider the task of assigning experts from a portfolio of specialists in order to solve a set of tasks. We apply a Bayesian model which combines collaborative filtering with a...
David H. Stern, Horst Samulowitz, Ralf Herbrich, T...
LREC
2008
134views Education» more  LREC 2008»
13 years 10 months ago
Generating a Morphological Lexicon of Organization Entity Names
This paper describes methods used for generating a morphological lexicon of organization entity names in Croatian. This resource is intended for two primary tasks: template-based ...
Nikola Ljubesic, Tomislava Lauc, Damir Boras
AIPS
2006
13 years 10 months ago
Lemma Reusing for SAT based Planning and Scheduling
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, K...