580 search results - page 45 / 116 » Choosing a random peer |
SODA
2001
ACM
15 years 1 months ago
2001
ACM
We propose a discrete variant of the Bak-Sneppen model for self-organized criticality. In this process, a configuration is an n-bit word, and at each step one chooses a random bit...
IPL
2000
14 years 11 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
119
click to vote
ESSLLI
2009
Springer
14 years 9 months ago
2009
Springer
This paper addresses the problem of selecting the `optimal' variable subset in a logistic regression model for a medium-sized data set. As a case study, we take the British En...
CAISE
2007
Springer
15 years 6 months ago
2007
Springer
In distributed work environments, where users are sharing and searching resources, ensuring an appropriate ranking at remote peers is a key problem. While this issue has been inves...
P2P
2009
IEEE
15 years 6 months ago
2009
IEEE
Peer-to-peer content dissemination applications suffer immensely from freeriders, i.e., nodes that do not provide their fair share. The Tit-for-Tat (TfT) incentives have received ...