Sciweavers

2391 search results - page 122 / 479
» A Portfolio Approach to Algorithm Selection
Sort
View
CIKM
2010
Springer
15 years 21 days ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
ICASSP
2011
IEEE
14 years 7 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...
QOSA
2010
Springer
15 years 1 months ago
A Hybrid Approach for Multi-attribute QoS Optimisation in Component Based Software Systems
Design decisions for complex, component-based systems impact multiple quality of service (QoS) properties. Often, means to improve one quality property deteriorate another one. In ...
Anne Martens, Danilo Ardagna, Heiko Koziolek, Raff...
EUROGP
2007
Springer
126views Optimization» more  EUROGP 2007»
15 years 7 months ago
Training Binary GP Classifiers Efficiently: A Pareto-coevolutionary Approach
The conversion and extension of the Incremental Pareto-Coevolution Archive algorithm (IPCA) into the domain of Genetic Programming classification is presented. In particular, the ...
Michal Lemczyk, Malcolm I. Heywood
AAAI
2006
15 years 4 months ago
Anytime Induction of Decision Trees: An Iterative Improvement Approach
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
Saher Esmeir, Shaul Markovitch