Sciweavers

735 search results - page 25 / 147
» Randomization in Parallel Stringology
Sort
View
125
Voted
PDCAT
2007
Springer
15 years 8 months ago
High Throughput Multi-port MT19937 Uniform Random Number Generator
ct There have been many previous attempts to accelerate MT19937 using FPGAs but we believe that we can substantially improve the previous implementations to develop a higher throug...
Vinay Sriram, David Kearney
90
Voted
IPPS
1998
IEEE
15 years 6 months ago
Sharing Random Bits with No Process Coordination
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
Marius Zimand
PODC
1998
ACM
15 years 6 months ago
Amortizing Randomness in Private Multiparty Computations
We study the relationship between the number of rounds needed to repeatedly perform a private computation i.e., where there are many sets of inputs sequentially given to the play...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...
160
Voted
PPSN
2010
Springer
15 years 9 days ago
Ant Colony Optimization with Immigrants Schemes in Dynamic Environments
Abstract. In recent years, there has been a growing interest in addressing dynamic optimization problems (DOPs) using evolutionary algorithms (EAs). Several approaches have been de...
Michalis Mavrovouniotis, Shengxiang Yang
CF
2010
ACM
15 years 5 months ago
Hybrid parallel programming with MPI and unified parallel C
The Message Passing Interface (MPI) is one of the most widely used programming models for parallel computing. However, the amount of memory available to an MPI process is limited ...
James Dinan, Pavan Balaji, Ewing L. Lusk, P. Saday...