Sciweavers

2373 search results - page 43 / 475
» Complexities for generalized models of self-assembly
Sort
View
AAAI
1997
15 years 5 months ago
Complex Goal Criteria and Its Application in Design-to-Criteria Scheduling
Difficult real-time AI problems require a means for expressing multi-dimensional and dynamic goal criteria and a principled model for satisficing to best meet the criteria. In the...
Thomas Wagner, Alan Garvey, Victor R. Lesser
TSP
2010
14 years 10 months ago
On entropy rate for the complex domain and its application to i.i.d. sampling
We derive the entropy rate formula for a complex Gaussian random process by using a widely linear model. The resulting expression is general and applicable to both circular and non...
Wei Xiong, Hualiang Li, Tülay Adali, Yi-Ou Li...
ICC
2007
IEEE
15 years 10 months ago
A Statistical Bit Error Generator for Emulation of Complex Forward Error Correction Schemes
— Forward Error Correction (FEC) schemes are generally used in wireless communication systems to maintain an acceptable quality of service. Various models have been proposed in l...
Reuben A. Farrugia, Carl James Debono
IPL
2006
104views more  IPL 2006»
15 years 4 months ago
The communication complexity of the Hamming distance problem
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 9 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun