Sciweavers

17129 search results - page 3093 / 3426
» Applied Computing
Sort
View
SPAA
2009
ACM
16 years 7 months ago
The weakest failure detector for wait-free dining under eventual weak exclusion
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch
PODC
2009
ACM
16 years 7 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
CAV
2009
Springer
165views Hardware» more  CAV 2009»
16 years 7 months ago
Symbolic Counter Abstraction for Concurrent Software
Counter Abstraction for Concurrent Software G?erard Basler1 , Michele Mazzucchi1 , Thomas Wahl1,2 , Daniel Kroening1,2 1 Computer Systems Institute, ETH Zurich, Switzerland 2 Compu...
Daniel Kroening, Gérard Basler, Michele Maz...
CHI
2003
ACM
16 years 7 months ago
The digital set-top box as a virtual channel provider
This research is based on the realization that the desktop computing paradigm is not appropriate for television, because it is adapted to fundamentally different user aspirations ...
Konstantinos Chorianopoulos
POPL
2006
ACM
16 years 7 months ago
Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
Steve Bishop, Matthew Fairbairn, Michael Norrish, ...
« Prev « First page 3093 / 3426 Last » Next »