4229 search results - page 484 / 846 » On the Optimality of Spiral Search |
194
click to vote
AAAI
2008
15 years 9 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 ...
159
click to vote
AAAI
1998
15 years 8 months ago
1998
A key assumption of all problem-solving approaches based on utility theory, including heuristic search, is that we can assign a utility or cost to each state. This in turn require...
205
click to vote
UAI
2000
15 years 8 months ago
2000
Algorithms for learning the conditional probabilities of Bayesian networks with hidden variables typically operate within a high-dimensional search space and yield only locally op...
195
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Equal allocation of bandwidth and/or power may not be efficient for wireless multi-user networks with limited bandwidth and power resources. Joint bandwidth and power allocation s...
177
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
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...