Sciweavers

344 search results - page 18 / 69
» The Santa Claus problem
Sort
View
JSAT
2006
109views more  JSAT 2006»
13 years 9 months ago
Decomposing SAT Problems into Connected Components
Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This o...
Armin Biere, Carsten Sinz
IWANN
2005
Springer
14 years 3 months ago
Input Selection for Long-Term Prediction of Time Series
Prediction of time series is an important problem in many areas of science and engineering. Extending the horizon of predictions further to the future is the challenging and diffic...
Jarkko Tikka, Jaakko Hollmén, Amaury Lendas...
CP
2005
Springer
14 years 3 months ago
Solving Over-Constrained Problems with SAT
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà
ILP
2007
Springer
14 years 4 months ago
ILP : - Just Trie It
Abstract. Despite the considerable success of Inductive Logic Programming, deployed ILP systems still have efficiency problems when applied to complex problems. Several techniques ...
Rui Camacho, Nuno A. Fonseca, Ricardo Rocha, V&iac...
ILP
2000
Springer
14 years 1 months ago
Induction of Recursive Theories in the Normal ILP Setting: Issues and Solutions
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
Floriana Esposito, Donato Malerba, Francesca A. Li...