Sciweavers

36887 search results - page 6 / 7378
» Are We All In the Same
Sort
View
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
14 years 1 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
14 years 2 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer
ICASSP
2011
IEEE
12 years 11 months ago
Are all basis updates for lattice-reduction-aided MIMO detection necessary?
The question in the title is relevant when considering latticereduction-aided MIMO detectors, which achieve the same diversity as the maximum-likelihood detector while exhibiting ...
Brian Gestner, Xiaoli Ma, David V. Anderson
IPPS
2000
IEEE
14 years 9 days ago
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks
Previous studies showed that the cross-talk problem on the all-optical networks exists at both links and switches of the networks. To solve the cross-talk problem at both links and...
Qian-Ping Gu, Shietung Peng
ICPP
1990
IEEE
13 years 12 months ago
Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes
All-to-all (ATA) reliable broadcast is the problem of reliably distributing information from every node to every other node in point-to-point interconnection networks. A good solut...
Sunggu Lee, Kang G. Shin