Sciweavers

2961 search results - page 166 / 593
» Optimization of tele-immersion codes
Sort
View
GLOBECOM
2008
IEEE
14 years 2 months ago
Low-Complexity SQR-Based Decoding Algorithm for Quasi-Orthogonal Space-Time Block Codes
— In this paper, we propose a new decoding algorithm for quasi-orthogonal space-time block codes (QOSTBCs) which achieves near Maximum Likelihood (ML) performance while substanti...
Luay Azzam, Ender Ayanoglu
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
14 years 20 days ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
13 years 12 months ago
Learning recursive programs with cooperative coevolution of genetic code mapping and genotype
The Probabilistic Adaptive Mapping Developmental Genetic Programming (PAM DGP) algorithm that cooperatively coevolves a population of adaptive mappings and associated genotypes is...
Garnett Carl Wilson, Malcolm I. Heywood
ICC
2007
IEEE
210views Communications» more  ICC 2007»
13 years 9 months ago
Dirty-Paper Coding without Channel Information at the Transmitter and Imperfect Estimation at the Receiver
—In this paper, we examine the effects of imperfect channel estimation at the receiver and no channel knowledge at the transmitter on the capacity of the fading Costa’s channel...
Pablo Piantanida, Pierre Duhamel
NIPS
1997
13 years 9 months ago
Learning to Schedule Straight-Line Code
Program execution speed on modern computers is sensitive, by a factor of two or more, to the order in which instructions are presented to the processor. To realize potential execu...
J. Eliot B. Moss, Paul E. Utgoff, John Cavazos, Do...