328 search results - page 46 / 66 » Simple Termination Revisited |
INFOCOM
2000
IEEE
13 years 12 months ago
2000
IEEE
Abstract—A challenging aspect of mobile communications consists in exploring ways in which the available run time of terminals can be maximized. In this paper, we present a detai...
ICLP
1997
Springer
13 years 11 months ago
1997
Springer
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
SIGCOMM
1994
ACM
13 years 11 months ago
1994
ACM
Applications communicating over connectionless networks, such as IP, cannot obtain per-connection Quality of Service (QoS) guarantees. In contrast, the connection-oriented nature ...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
CCS
2009
ACM
14 years 8 months ago
2009
ACM
We revisit the venerable question of access credentials management, which concerns the techniques that we, humans with limited memory, must employ to safeguard our various access ...