14704 search results - page 2646 / 2941 » computing 2007 |
130
click to vote
WDAG
2007
Springer
15 years 10 months ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
105
Voted
WDAG
2007
Springer
15 years 10 months ago
2007
Springer
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
150
click to vote
WDAG
2007
Springer
15 years 10 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
132
Voted
WEBI
2007
Springer
15 years 10 months ago
2007
Springer
The paper develops a novel computational framework for predicting communication flow in social networks based on several contextual features. The problem is important because pred...
134
Voted
WINE
2007
Springer
15 years 10 months ago
2007
Springer
We consider a model of content contribution in peer-to-peer networks with linear quadratic payoffs and very general interaction patterns. We find that Nash equilibria of this gam...