1405 search results - page 262 / 281 » Anytime Algorithm for Feature Selection |
105
click to vote
COCO
2004
Springer
15 years 3 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
102
click to vote
HIS
2007
15 years 1 months ago
2007
—Machine learning is inherently a multiobjective task. Traditionally, however, either only one of the objectives is adopted as the cost function or multiple objectives are aggreg...
ICML
2010
IEEE
15 years 23 days ago
2010
IEEE
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
132
click to vote
BMCBI
2007
14 years 11 months ago
2007
Background: Designing appropriate machine learning methods for identifying genes that have a significant discriminating power for disease outcomes has become more and more importa...
101
click to vote
BMCBI
2007
14 years 11 months ago
2007
Background: Gene expression is governed by complex networks, and differences in expression patterns between distinct biological conditions may therefore be complex and multivariat...