2479 search results - page 340 / 496 » Quantum complexity theory |
177
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
164
click to vote
ACIVS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Feature subset selection is an important subject when training classifiers in Machine Learning (ML) problems. Too many input features in a ML problem may lead to the so-...
193
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
174
click to vote
AIED
2009
Springer
16 years 1 months ago
2009
Springer
Identifying effective tutorial strategies is a key problem for tutorial dialogue systems research. Ongoing work in human-human tutorial dialogue continues to reveal the complex phe...
179
click to vote
AIED
2009
Springer
16 years 1 months ago
2009
Springer
Design of collaborative learning (CL) scenarios is a complex task, but necessary if the goal of the collaboration is learning. Creating well-thought-out CL scenarios requires exper...