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 ...
—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, ...
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...
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
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...