5056 search results - page 725 / 1012 » Network Coding Theory |
198
click to vote
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
239
Voted
GECCO
2011
Springer
14 years 10 months ago
2011
Springer
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
184
click to vote
NETWORK
2008
15 years 6 months ago
2008
Recently, WiMAX has been proposed as an attractive wireless communication technology for providing broadband access for metropolitan areas. Despite its salient features from the t...
172
click to vote
SIGSOFT
2007
ACM
16 years 7 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
159
click to vote
EUROSYS
2010
ACM
16 years 3 months ago
2010
ACM
Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20.000 lines of challenging C++ code encompassing synchronization, networking and cryptogra...