1716 search results - page 84 / 344 » Proving Conditional Termination |
121
Voted
VTC
2007
IEEE
15 years 7 months ago
2007
IEEE
— “Word-of-Mouth”, a novel scheme for sharing the service quality experienced with different local networks, is presented and evaluated as a distributed solution for performi...
126
Voted
IWCMC
2006
ACM
15 years 7 months ago
2006
ACM
This paper presents a load-based transmission scheduling (LoBaTS) protocol for wireless ad hoc networks. Since terminals in these networks may be required to forward unequal amoun...
118
Voted
KR
2010
Springer
15 years 5 months ago
2010
Springer
This is a case-study in knowledge representation. We analyze the ‘one hundred prisoners and a lightbulb’ puzzle. In this puzzle it is relevant what the agents (prisoners) know...
106
Voted
FSTTCS
2004
Springer
15 years 6 months ago
2004
Springer
Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability priced timed game automata and prove ...
224
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...