Sciweavers

226 search results - page 45 / 46
» Parallel mixing
Sort
View
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
13 years 11 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan
TVCG
2010
157views more  TVCG 2010»
13 years 5 months ago
Metric-Driven RoSy Field Design and Remeshing
—Designing rotational symmetry fields on surfaces is an important task for a wide range of graphics applications. This work introduces a rigorous and practical approach for auto...
Yu-Kun Lai, Miao Jin, Xuexiang Xie, Ying He 0001, ...
TCOM
2010
114views more  TCOM 2010»
13 years 1 months ago
Achieving near-capacity performance on multiple-antenna channels with a simple concatenation scheme
This paper proposes a capacity-approaching, yet simple scheme for multi-input multiple-output (MIMO) channels. The proposed scheme is based on a concatenation of a mixture of short...
Nghi H. Tran, Tho Le-Ngoc, Tad Matsumoto, Ha H. Ng...
DC
2011
12 years 6 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
PODC
2009
ACM
14 years 7 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...