1653 search results - page 137 / 331 » Computer science and game theory |
84
Voted
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
We address the problem of alternating simulation refinement for concurrent timed games (TG). We show that checking timed alternating simulation between TG is EXPTIME-complete, and...
86
Voted
ICALP
2004
Springer
15 years 6 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
117
Voted
JOT
2008
15 years 20 days ago
2008
The attractive idea of using game development for teaching programming can only meet student expectations and modern software engineering requirements if it uses advanced multimed...
103
click to vote
IUI
2003
ACM
15 years 6 months ago
2003
ACM
We present a probabilistic model, based on Dynamic Decision Networks, to assess user affect from possible causes of emotional arousal. The model relies on the OCC cognitive theory...
IGPL
2008
15 years 7 days ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...