3946 search results - page 230 / 790 » The computational complexity of choice sets |
212
click to vote
ICANN
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. Tuning hyper-parameters is a necessary step to improve learning algorithm performances. For Support Vector Machine classifiers, adjusting kernel parameters increases dra...
167
click to vote
CP
2004
Springer
16 years 2 days ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
184
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
180
Voted
MODELS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Predefined composite operations are handy for efficient modeling, e.g., for the automatic execution of refactorings, and for the introduction of patterns in existing mod...
178
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We present and evaluate a method for estimating the relevance and calibrating the values of parameters of an evolutionary algorithm. The method provides an information theoretic m...