459 search results - page 20 / 92 » Average Case Analysis of Conjunctive Learning Algorithms |
AAAI
1993
13 years 9 months ago
1993
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
AMAST
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. A general parametric analysis problem which allows the use of parameter variables in both the realtime automata and the specifications is proposed and solved. The analys...
ML
2006
ACM
13 years 7 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...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of datamanagement problems. For select-project-join SQ...
BMCBI
2008
13 years 7 months ago
2008
Background: Eukaryotic promoter prediction using computational analysis techniques is one of the most difficult jobs in computational genomics that is essential for constructing a...