<--- Back to Details
First PageDocument Content
Mathematics / Self-stabilization / Randomized algorithm / Search algorithms / Routing algorithms / Small world routing / Superstabilization / Theoretical computer science / Computational complexity theory / Fault-tolerant computer systems
Date: 2014-09-26 08:28:48
Mathematics
Self-stabilization
Randomized algorithm
Search algorithms
Routing algorithms
Small world routing
Superstabilization
Theoretical computer science
Computational complexity theory
Fault-tolerant computer systems

Add to Reading List

Source URL: dcg.ethz.ch

Download Document from Source Website

File Size: 186,28 KB

Share Document on Facebook

Similar Documents

VEHICLE ROUTING ALGORITHMS FOR RADIALLY ESCAPING TARGETS PUSHKARINI AGHARKAR †,

DocID: 1vkvr - View Document

T HEORY OF C OMPUTING, Volume), pp. 179–199 www.theoryofcomputing.org Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing

DocID: 1uOB1 - View Document

Improving Non-Minimal and Adaptive Routing Algorithms in Slim Fly Networks Pedro Y´ebenes∗ , Jesus Escudero-Sahuquillo∗ , Pedro J. Garc´ıa∗ , Francisco J. Quiles∗ , and Torsten Hoefler† ∗ Department of Co

DocID: 1tVFZ - View Document

Trust-based Anonymous Communication: Adversary Models and Routing Algorithms ∗ Aaron Johnson

DocID: 1tMc3 - View Document

1 Distributed routing algorithms to manage power flow in agent-based active distribution network Phuong H. Nguyen, Wil L. Kling, Member, IEEE, Giorgos Georgiadis, Marina Papatriantafilou, Le Anh Tuan, Member IEEE, Lina

DocID: 1sdUe - View Document