Sciweavers

1716 search results - page 84 / 344
» Proving Conditional Termination
Sort
View
VTC
2007
IEEE
132views Communications» more  VTC 2007»
14 years 3 months ago
Collaborative Information Revelation and Collusion in "Word-of-Mouth" Access Selection Schemes
— “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...
Pietro Lungaro
IWCMC
2006
ACM
14 years 2 months ago
A distributed load-based transmission scheduling protocol for wireless ad hoc networks
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...
Brian J. Wolf, Joseph L. Hammond, Harlan B. Russel...
KR
2010
Springer
14 years 1 months ago
One Hundred Prisoners and a Lightbulb - Logic and Computation
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...
Hans P. van Ditmarsch, Jan van Eijck, William Wu
FSTTCS
2004
Springer
14 years 2 months ago
Optimal Strategies in Priced Timed Game Automata
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 ...
Patricia Bouyer, Franck Cassez, Emmanuel Fleury, K...
POPL
2009
ACM
14 years 9 months ago
A combination framework for tracking partition sizes
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...
Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv