Sciweavers

397 search results - page 46 / 80
» An empirical study of optimizations in YOGI
Sort
View
HICSS
2003
IEEE
121views Biometrics» more  HICSS 2003»
14 years 1 months ago
Repeatable Quality Assurance Techniques for Requirements Negotiations
Many software projects fail because early life-cycle defects such as ill-defined requirements are not identified and removed. Therefore, quality assurance (QA) techniques for defe...
Paul Grünbacher, Michael Halling, Stefan Biff...
CP
2006
Springer
13 years 11 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...
AIPS
2006
13 years 9 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley
ML
2006
ACM
142views Machine Learning» more  ML 2006»
13 years 7 months ago
The max-min hill-climbing Bayesian network structure learning algorithm
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....
EC
2006
136views ECommerce» more  EC 2006»
13 years 7 months ago
Error Thresholds in Genetic Algorithms
The error threshold of replication is an important notion of the quasispecies evolution model; it is a critical mutation rate (error rate) beyond which structures obtained by an e...
Gabriela Ochoa