Sciweavers

717 search results - page 109 / 144
» Kill-safe synchronization abstractions
Sort
View
UC
2005
Springer
15 years 11 months ago
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
Predrag T. Tosic, Gul A. Agha
CSCW
2004
ACM
15 years 11 months ago
Controlling interruptions: awareness displays and social motivation for coordination
Spontaneous communication is common in the workplace but can be disruptive. Such communication usually benefits the initiator more than the target of an interruption. Previous res...
Laura A. Dabbish, Robert E. Kraut
HUC
2004
Springer
15 years 11 months ago
The NearMe Wireless Proximity Server
Abstract. NearMe is a server, algorithms, and application programming interfaces (APIs) for clients equipped with 802.11 wireless networking (Wi-Fi) to compute lists of people and ...
John Krumm, Ken Hinckley
ISOLA
2004
Springer
15 years 11 months ago
Case Studies with Lurette V2
Abstract. Lurette is an automated testing tool dedicated to reactive programs. The test process is automated at two levels: given a formal description of the System Under Test (SUT...
Erwan Jahier, Pascal Raymond, Philippe Baufreton
PARA
2004
Springer
15 years 11 months ago
Parallel Discrete Event Simulations of Grid-Based Models: Asynchronous Electromagnetic Hybrid Code
Abstract. The traditional technique to simulate physical systems modeled by partial differential equations is by means of a time-stepped methodology where the state of the system ...
Homa Karimabadi, Jonathan Driscoll, Jagrut Dave, Y...