Sciweavers

5580 search results - page 47 / 1116
» Randomized priority algorithms
Sort
View
ICPP
2005
IEEE
15 years 3 months ago
Locality-Aware Randomized Load Balancing Algorithms for DHT Networks
Structured P2P overlay networks based on a consistent hashing function have an aftermath load balance problem that needs to be dealt with. A load balancing method should take into...
Haiying Shen, Cheng-Zhong Xu
CSR
2007
Springer
15 years 3 months ago
Pushing Random Walk Beyond Golden Ratio
We propose a simple modification of a well-known Random Walk algorithm for solving the Satisfiability problem and analyze its performance on random CNFs with a planted solution. ...
Ehsan Amiri, Evgeny S. Skvortsov
SPIN
2007
Springer
15 years 3 months ago
Minimal Counterexample Generation for SPIN
We propose an algorithm to compute a counterexample of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nes...
Paul Gastin, Pierre Moro
IPL
2010
79views more  IPL 2010»
14 years 8 months ago
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
Christophe Crespelle, Philippe Gambette
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
15 years 3 months ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen