279 search results - page 47 / 56 » Timed Concurrent Game Structures |
262
Voted
STOC
1993
ACM
15 years 10 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
152
Voted
INFOCOM
2006
IEEE
16 years 11 days ago
2006
IEEE
— 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...
190
Voted
CACM
1998
15 years 6 months ago
1998
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 ...
143
Voted
SP
2009
IEEE
16 years 1 months ago
2009
IEEE
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 ...
149
Voted
SOFTVIS
2006
ACM
16 years 9 days ago
2006
ACM
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...