Sciweavers

5580 search results - page 321 / 1116
» Randomized priority algorithms
Sort
View
175
Voted
TCS
2010
15 years 5 months ago
Maximum likelihood analysis of algorithms and data structures
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
Ulrich Laube, Markus E. Nebel
CORR
2011
Springer
148views Education» more  CORR 2011»
15 years 1 months ago
On Stabilization in Herman's Algorithm
Herman’s algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics o...
Stefan Kiefer, Andrzej S. Murawski, Joël Ouak...
197
Voted
AINA
2007
IEEE
16 years 1 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
WSC
2008
15 years 9 months ago
SR-1: A simulation-based algorithm for the Capacitated Vehicle Routing Problem
In this paper we present SR-1, a simulation-based heuristic algorithm for the Capacitated Vehicle Routing Problem (CVRP). Given a CVRP instance, SR-1 uses an initial "good so...
Javier Faulin, Miquel Gilibert, Angel A. Juan, Xav...
GECCO
2008
Springer
324views Optimization» more  GECCO 2008»
15 years 7 months ago
Convergence behavior of the fully informed particle swarm optimization algorithm
The fully informed particle swarm optimization algorithm (FIPS) is very sensitive to changes in the population topology. The velocity update rule used in FIPS considers all the ne...
Marco Antonio Montes de Oca, Thomas Stützle