Sciweavers

5171 search results - page 421 / 1035
» Deterministic Parallel Processing
Sort
View
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
15 years 8 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
CCR
2008
101views more  CCR 2008»
15 years 4 months ago
Empirical evaluation of hash functions for multipoint measurements
A broad spectrum of network measurement applications demand passive multipoint measurements in which data from multiple observation points has to be correlated. Examples are the p...
Christian Henke, Carsten Schmoll, Tanja Zseby
CORR
2010
Springer
249views Education» more  CORR 2010»
15 years 4 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
JSSPP
2009
Springer
15 years 10 months ago
Limits of Work-Stealing Scheduling
The number of applications with many parallel cooperating processes is steadily increasing, and developing efficient runtimes for their execution is an important task. Several fram...
Zeljko Vrba, Håvard Espeland, Pål Halv...
IPPS
1998
IEEE
15 years 8 months ago
Rendering Computer Animations on a Network of Workstations
Rendering high-quality computer animations requires intensive computation, and therefore a large amount of time. One way to speed up this process is to devise rendering algorithms...
Timothy D. Davis, Edward W. Davis