Sciweavers

198 search results - page 11 / 40
» Tensor Rank: Some Lower and Upper Bounds
Sort
View
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
15 years 3 months ago
Some theoretical results about the computation time of evolutionary algorithms
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
Lixin X. Ding, Jinghu Yu
CPC
1998
91views more  CPC 1998»
14 years 9 months ago
Complexity and Probability of Some Boolean Formulas
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
Petr Savický
TIT
2008
90views more  TIT 2008»
14 years 10 months ago
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
Gil Wiechman, Igal Sason
FLAIRS
2006
14 years 11 months ago
Some Second Order Effects on Interval Based Probabilities
In real-life decision analysis, the probabilities and values of consequences are in general vague and imprecise. One way to model imprecise probabilities is to represent a probabi...
David Sundgren, Mats Danielson, Love Ekenberg
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 5 months ago
Secure Communication over Parallel Relay Channel
We investigate the problem of secure communication over parallel relay channel in the presence of a passive eavesdropper. We consider a four terminal relay-eavesdropper channel wh...
Zohaib Hassan Awan, Abdellatif Zaidi, Luc Vandendo...