5115 search results - page 348 / 1023 » On Randomized Lanczos Algorithms |
202
click to vote
AE
2005
Springer
16 years 29 days ago
2005
Springer
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...
208
click to vote
DCOSS
2005
Springer
16 years 28 days ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
202
click to vote
INFOCOM
2003
IEEE
16 years 21 days ago
2003
IEEE
— Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in...
227
click to vote
ICALP
2003
Springer
16 years 19 days ago
2003
Springer
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
189
click to vote
SPIRE
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...