Sciweavers

7129 search results - page 423 / 1426
» Approximation Algorithms for Treewidth
Sort
View
ICC
2007
IEEE
116views Communications» more  ICC 2007»
16 years 14 days ago
A Simple Iterative Gaussian Detector for Severely Delay-Spread MIMO Channels
— In this paper, a low-complexity high-performance detection algorithm for multiple input multiple output (MIMO) channels with severe delay spread is proposed. This algorithm per...
Tianbin Wo, Peter Adam Hoeher
SPIRE
2005
Springer
15 years 11 months ago
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
Luís M. S. Russo, Arlindo L. Oliveira
GECCO
2006
Springer
130views Optimization» more  GECCO 2006»
15 years 9 months ago
An efficient multi-objective evolutionary algorithm with steady-state replacement model
The generic Multi-objective Evolutionary Algorithm (MOEA) aims to produce Pareto-front approximations with good convergence and diversity property. To achieve convergence, most mu...
Dipti Srinivasan, Lily Rachmawati
INFOCOM
2007
IEEE
16 years 14 days ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
16 years 9 days ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland