10392 search results - page 1754 / 2079 » Introduction to Computer Science |
154
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We exhibit a deterministic concurrent reachability game PURGATORYn with n non-terminal positions and a binary choice for both players in every position so that any positional st...
184
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
197
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted be...
179
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 ...
177
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...