Sciweavers

735 search results - page 24 / 147
» Randomization in Parallel Stringology
Sort
View
IRREGULAR
1995
Springer
14 years 1 days ago
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D...
JDA
2008
100views more  JDA 2008»
13 years 8 months ago
Efficient sampling of random permutations
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
Jens Gustedt
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
14 years 2 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
HIPC
1999
Springer
14 years 24 days ago
Stochastic Modeling of TCP/IP over Random Loss Channels
An analytical framework for modeling the performance of a single TCP session in the presence of random packet loss is presented that is based on a semi-Markov model for the window ...
Alhussein A. Abouzeid, Murat Azizoglu, Sumit Roy
ISAAC
1997
Springer
162views Algorithms» more  ISAAC 1997»
14 years 20 days ago
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
Chung Keung Poon, Vijaya Ramachandran