Sciweavers

4155 search results - page 702 / 831
» Topic-Specific Optimization and Structuring
Sort
View
CP
2006
Springer
15 years 5 months ago
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevi...
CP
2006
Springer
15 years 5 months ago
Distributed Constraint-Based Local Search
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
Laurent Michel, Andrew See, Pascal Van Hentenryck
CPM
2006
Springer
107views Combinatorics» more  CPM 2006»
15 years 5 months ago
Tiling an Interval of the Discrete Line
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
Olivier Bodini, Eric Rivals
ECAI
2006
Springer
15 years 5 months ago
Logic Programs with Multiple Chances
Abstract. In human-like reasoning it often happens that different conditions, partially alternative and hierarchically structured, are mentally grouped in order to derive some conc...
Francesco Buccafurri, Gianluca Caminiti, Domenico ...
EGICE
2006
15 years 5 months ago
Combining Two Data Mining Methods for System Identification
System identification is an abductive task which is affected by several kinds of modeling assumptions and measurement errors. Therefore, instead of optimizing values of parameters ...
Sandro Saitta, Benny Raphael, Ian F. C. Smith