376 search results - page 10 / 76 » Developing Theories of Types and Computability via Realizabi... |
CHI
2007
ACM
14 years 7 months ago
2007
ACM
The ability to detect and differentiate breakpoints during task execution is critical for enabling defer-to-breakpoint policies within interruption management. In this work, we ex...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
We introduce a computable framework for Lebesgue’s measure and integration theory in the spirit of domain theory. For an effectively given second countable locally compact Hausd...
ICDCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Earlier work has developed the underpinnings of a theory of scheduling computations having intertask dependencies—modeled via dags—for Internet-based computing. The goal of th...
ISIPTA
1999
IEEE
13 years 11 months ago
1999
IEEE
The paper deals with basic issues regarding the measurement of relevant types of uncertainty and uncertainty-based information in theories that represent imprecise probabilities o...
LATA
2010
Springer
14 years 4 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...