86 search results - page 14 / 18 » Pruning Improves Heuristic Search for Cost-Sensitive Learnin... |
ICMLA
2007
13 years 9 months ago
2007
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
CGO
2003
IEEE
14 years 28 days ago
2003
IEEE
To meet the performance demands of modern architectures, compilers incorporate an everincreasing number of aggressive code transformations. Since most of these transformations are...
AAAI
2008
13 years 10 months ago
2008
Based on Information Theory, optimal feature selection should be carried out by searching Markov blankets. In this paper, we formally analyze the current Markov blanket discovery ...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Relevance Feedback has proven very effective for improving retrieval accuracy. A difficult yet important problem in all relevance feedback methods is how to optimally balance the...
KR
1992
Springer
13 years 11 months ago
1992
Springer
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...