To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
— This paper1 presents the design and implementation of an Ant Colony Optimization based algorithm for solving the DAG Layering Problem. This algorithm produces compact layerings...
Radoslav Andreev, Patrick Healy, Nikola S. Nikolov
This paper describes a novel compile-time list-based task scheduling algorithm for distributed-memory systems, called Fast Load Balancing (FLB). Compared to other typical list sch...
Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...
Abstract. This article presents a randomized algorithm for leader election which uses bidirectionality of an asynchronous ring to force a node to "commit" to a coin flip ...