Sciweavers

5693 search results - page 1021 / 1139
» Socially relevant computing
Sort
View
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
16 years 1 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson
MOBIHOC
2007
ACM
16 years 1 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
141
Voted
MOBIHOC
2002
ACM
16 years 1 months ago
Comparison of broadcasting techniques for mobile ad hoc networks
Network wide broadcasting in Mobile Ad Hoc Networks provides important control and route establishment functionality for a number of unicast and multicast protocols. Considering i...
Brad Williams, Tracy Camp
SC
2009
ACM
15 years 8 months ago
FACT: fast communication trace collection for parallel applications through program slicing
A proper understanding of communication patterns of parallel applications is important to optimize application performance and design better communication subsystems. Communicatio...
Jidong Zhai, Tianwei Sheng, Jiangzhou He, Wenguang...
PRDC
2009
IEEE
15 years 8 months ago
Quantifying Criticality of Dependability-Related IT Organization Processes in CobiT
—With ever-growing complexity of computer and communication systems analytical methods do not scale, especially with respect to dependability assessment of information technology...
Tobias Goldschmidt, Andreas Dittrich, Miroslaw Mal...
« Prev « First page 1021 / 1139 Last » Next »