Sciweavers

224 search results - page 8 / 45
» A Process-Oriented Heuristic for Model Selection
Sort
View
HEURISTICS
1998
252views more  HEURISTICS 1998»
15 years 3 days ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
P. C. Chu, J. E. Beasley
101
Voted
IDA
2002
Springer
15 years 6 days ago
Evolutionary model selection in unsupervised learning
Feature subset selection is important not only for the insight gained from determining relevant modeling variables but also for the improved understandability, scalability, and pos...
YongSeog Kim, W. Nick Street, Filippo Menczer
102
Voted
ACMMSP
2004
ACM
101views Hardware» more  ACMMSP 2004»
15 years 5 months ago
Metrics and models for reordering transformations
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
Michelle Mills Strout, Paul D. Hovland
CADE
2000
Springer
15 years 4 months ago
Two Techniques to Improve Finite Model Search
Abstract. This article introduces two techniques to improve the propagation efficiency of CSP based finite model generation methods. One approach consists in statically rewriting ...
Gilles Audemard, Belaid Benhamou, Laurent Henocque
81
Voted
WSC
2007
15 years 2 months ago
Implications of heavy tails on simulation-based ordinal optimization
We consider the problem of selecting the best system using simulation-based ordinal optimization. This problem has been studied mostly in the context of light-tailed distributions...
Mark Broadie, Minsup Han, Assaf Zeevi