Sciweavers

5153 search results - page 291 / 1031
» Introduction to Randomized Algorithms
Sort
View
136
Voted
IPPS
2005
IEEE
15 years 9 months ago
PDM Sorting Algorithms That Take A Small Number of Passes
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
Sanguthevar Rajasekaran, Sandeep Sen
CAV
2006
Springer
133views Hardware» more  CAV 2006»
15 years 7 months ago
Antichains: A New Algorithm for Checking Universality of Finite Automata
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
Martin De Wulf, Laurent Doyen, Thomas A. Henzinger...
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
15 years 7 months ago
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 3 months ago
Local Information Based Algorithms for Packet Transport in Complex Networks
Abstract. We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node...
Bernard Kujawski, G. J. Rodgers, Bosiljka Tadic
ECCC
2006
97views more  ECCC 2006»
15 years 3 months ago
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...
Frank Neumann, Carsten Witt