Sciweavers

279 search results - page 47 / 56
» Timed Concurrent Game Structures
Sort
View
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
14 years 23 days ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
INFOCOM
2006
IEEE
14 years 2 months ago
The Complexity of Connectivity in Wireless Networks
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
Thomas Moscibroda, Roger Wattenhofer
CACM
1998
103views more  CACM 1998»
13 years 8 months ago
The Virtual Design Team
The long range goal of the “Virtual Design Team” (VDT) research program is to develop computational tools to analyze decision making and communication behavior and thereby to ...
John C. Kunz, Tore R. Christiansen, Geoff P. Cohen...
SP
2009
IEEE
14 years 3 months ago
The Mastermind Attack on Genomic Data
In this paper, we study the degree to which a genomic string, Q, leaks details about itself any time it engages in comparison protocols with a genomic querier, Bob, even if those ...
Michael T. Goodrich
SOFTVIS
2006
ACM
14 years 2 months ago
Using social agents to visualize software scenarios
Enabling nonexperts to understand a software system and the scenarios of usage of that system can be challenging. Visually modeling a collection of scenarios as social interaction...
Thomas A. Alspaugh, Bill Tomlinson, Eric Baumer