210 search results - page 36 / 42 » A Unified Theory of Irony and Its Computational Formalizatio... |
CIE
2010
Springer
13 years 11 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
DIGRA
2005
Springer
14 years 28 days ago
2005
Springer
This paper is an addition to the discourse surrounding interface theory and pervasive games. A buzzword by nature, the term ´interface´ needs to be investigated and redefined in...
TPHOL
2007
IEEE
14 years 1 months ago
2007
IEEE
Formal, modular, and mechanized verification of realistic systems code is desirable but challenging. Verification of machine context management (a basis of multi-tasking) is one ...
FSS
2006
13 years 7 months ago
2006
Among the various extensions to the common [0, 1]-valued truth degrees of "traditional" fuzzy set theory, closed intervals of [0, 1] stand out as a particularly appealin...
ATAL
2003
Springer
14 years 19 days ago
2003
Springer
A key question in the field of agent-oriented software engineering is how the kind and extent of autonomy owned by computational agents can be appropriately captured. As long as ...