Sciweavers

6251 search results - page 1025 / 1251
» Randomness, Computability, and Density
Sort
View
134
Voted
P2P
2007
IEEE
153views Communications» more  P2P 2007»
15 years 11 months ago
On Routing in Distributed Hash Tables
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 ...
Fabius Klemm, Sarunas Girdzijauskas, Jean-Yves Le ...
156
Voted
APPROX
2007
Springer
160views Algorithms» more  APPROX 2007»
15 years 10 months ago
Better Binary List-Decodable Codes Via Multilevel Concatenation
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...
Venkatesan Guruswami, Atri Rudra
139
Voted
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 10 months ago
Some novel locality results for the blob code spanning tree representation
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...
Tim Paulden, David K. Smith
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 10 months ago
Takeover times on scale-free topologies
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...
Joshua L. Payne, Margaret J. Eppstein
MFCS
2007
Springer
15 years 10 months ago
Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach
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...
Spyros C. Kontogiannis, Paul G. Spirakis
« Prev « First page 1025 / 1251 Last » Next »