Sciweavers

1716 search results - page 64 / 344
» Proving Conditional Termination
Sort
View
SAC
2000
ACM
14 years 1 months ago
A Mobile Agent Infrastructure for the Mobility Support
The mobility of terminals and users is a crucial issue in the open global system represented by the Internet. Supporting terminal and user mobility requires a middleware infrastru...
Paolo Bellavista, Antonio Corradi, Cesare Stefanel...
USENIX
2007
13 years 11 months ago
Exploring Recovery from Operating System Lockups
Operating system lockup errors can render a computer unusable by preventing the execution other programs. Watchdog timers can be used to recover from a lockup by resetting the pro...
Francis M. David, Jeffrey C. Carlyle, Roy H. Campb...
STOC
2003
ACM
137views Algorithms» more  STOC 2003»
14 years 9 months ago
Near-optimal network design with selfish agents
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
Elliot Anshelevich, Anirban Dasgupta, Éva T...
SAS
2004
Springer
123views Formal Methods» more  SAS 2004»
14 years 2 months ago
Non-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Étienne Payet, Frédéric Mesna...
PODC
2009
ACM
14 years 9 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan