Sciweavers

1653 search results - page 293 / 331
» Computer science and game theory
Sort
View
AIED
2009
Springer
14 years 3 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...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 3 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
14 years 2 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland
IFM
2007
Springer
245views Formal Methods» more  IFM 2007»
14 years 2 months ago
Co-simulation of Distributed Embedded Real-Time Control Systems
Development of computerized embedded control systems is difficult because it brings together systems theory, electrical engineering and computer science. The engineering and analys...
Marcel Verhoef, Peter Visser, Jozef Hooman, Jan F....
ICALP
2005
Springer
14 years 2 months ago
Decidability and Complexity Results for Timed Automata via Channel Machines
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
Parosh Aziz Abdulla, Johann Deneux, Joël Ouak...