Sciweavers

7522 search results - page 73 / 1505
» Spacing memetic algorithms
Sort
View
GLOBECOM
2008
IEEE
15 years 7 months ago
Reduced Complexity ML Detection for Differential Unitary Space-Time Modulation with Carrier Frequency Offset
— Recently, a maximum likelihood (ML) detection rule for differential unitary space time modulation (DUSTM) under the existence of unknown carrier frequency offset (CFO) has been...
Feifei Gao, Arumugam Nallanathan, Chintha Tellambu...
89
Voted
SSS
2009
Springer
115views Control Systems» more  SSS 2009»
15 years 5 months ago
How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity?
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in message forwarding problem in a m...
Alain Cournier, Swan Dubois, Vincent Villain
108
Voted
CPE
1998
Springer
80views Hardware» more  CPE 1998»
15 years 4 months ago
Probability, Parallelism and the State Space Exploration Problem
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
William J. Knottenbelt, Mark Mestern, Peter G. Har...
101
Voted
SODA
2004
ACM
87views Algorithms» more  SODA 2004»
15 years 1 months ago
Optimal space lower bounds for all frequency moments
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
David P. Woodruff
91
Voted
AUTOMATICA
2006
109views more  AUTOMATICA 2006»
15 years 17 days ago
Closed-loop subspace identification using the parity space
It is known that many subspace algorithms give biased estimates for closed-loop data due to the existence of feedback. In this paper we present a new subspace identification metho...
Jin Wang, S. Joe Qin