522 search results - page 38 / 105 » A Graph Theoretical Approach to Network Encoding Complexity |
135
click to vote
IPPS
2009
IEEE
15 years 9 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
176
click to vote
STACS
2012
Springer
13 years 10 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
131
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
112
click to vote
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
127
click to vote
GECCO
2007
Springer
15 years 9 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...