6251 search results - page 1025 / 1251 » Randomness, Computability, and Density |
191
click to vote
P2P
2007
IEEE
16 years 1 months ago
2007
IEEE
There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are ...
209
click to vote
APPROX
2007
Springer
16 years 1 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
181
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
203
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The topological properties of a network directly impact the flow of information through a system. In evolving populations, the topology of inter-individual interactions affects th...
171
click to vote
MFCS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...