Sciweavers

13306 search results - page 2317 / 2662
» Theoretical Computer Science
Sort
View
LICS
2009
IEEE
16 years 2 months ago
An Improved Lower Bound for the Complementation of Rabin Automata
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 ...
Yang Cai, Ting Zhang, Haifeng Luo
AIED
2009
Springer
16 years 2 months ago
Discovering Tutorial Dialogue Strategies with Hidden Markov Models
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...
Kristy Elizabeth Boyer, Eunyoung Ha, Michael D. Wa...
ATAL
2009
Springer
16 years 2 months ago
Stronger CDA strategies through empirical game-theoretic analysis and reinforcement learning
We present a general methodology to automate the search for equilibrium strategies in games derived from computational experimentation. Our approach interleaves empirical game-the...
L. Julian Schvartzman, Michael P. Wellman
CSEE
2009
Springer
16 years 2 months ago
Evaluating Software Inspection Cognition Levels Using Bloom's Taxonomy
This paper reports on results from a pilot study that used Bloom’s Taxonomy to observe cognition levels during software inspections conducted by undergraduate computer science a...
David A. McMeekin, Brian R. von Konsky, Elizabeth ...
CSEE
2009
Springer
16 years 2 months ago
Software Engineering Education for Bioinformatics
As software engineering educators, it is important for us to realize the increasing domainspecificity of software, and incorporate these changes in our design of teaching material...
Medha Umarji, Carolyn B. Seaman, Akif Günes K...
« Prev « First page 2317 / 2662 Last » Next »