Sciweavers

1073 search results - page 127 / 215
» ParaDisEO-Based Design of Parallel and Distributed Evolution...
Sort
View
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
14 years 25 days ago
Estimating the destructiveness of crossover on binary tree representations
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
Luke Sheneman, James A. Foster
PODC
2009
ACM
14 years 9 months ago
On a selfish caching game
In this work we define and study a new model for the caching problem in a heterogeneous wireless network under a flash-crowd scenario. Using non-cooperative game theory, we cast t...
Pietro Michiardi, Carla-Fabiana Chiasserini, Claud...
PDCAT
2007
Springer
14 years 3 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
IJHPCA
2010
88views more  IJHPCA 2010»
13 years 7 months ago
Madre: the Memory-Aware Data Redistribution Engine
We report on the development of a new computational framework for efficiently carrying out parallel data redistribution in a limited memory environment. This new library, MADRE (T...
Stephen F. Siegel, Andrew R. Siegel
CCR
2010
151views more  CCR 2010»
13 years 6 months ago
iNFAnt: NFA pattern matching on GPGPU devices
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...
Niccolo Cascarano, Pierluigi Rolando, Fulvio Risso...