580 search results - page 112 / 116 » Choosing a random peer |
CHI
1993
ACM
15 years 3 months ago
1993
ACM
An adaptive user interface relies, to a large extent, upon an adequate user model (e.g., a representationof user-expertise). However, building a user model may be a tedious and ti...
ICDCS
2010
IEEE
15 years 3 months ago
2010
IEEE
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
137
click to vote
ESA
2007
Springer
15 years 3 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
120
click to vote
DAGSTUHL
2007
15 years 1 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...