Sciweavers

350 search results - page 52 / 70
» Lower and upper bounds on obtaining history independence
Sort
View
TCOM
2008
151views more  TCOM 2008»
14 years 11 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee
SPAA
2006
ACM
15 years 5 months ago
Semi-oblivious routing
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, To...
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
15 years 5 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
LATA
2011
Springer
14 years 2 months ago
Networks of Evolutionary Processors with Subregular Filters
In this paper we propose a hierarchy of classes of languages, generated by networks of evolutionary processors with the filters in several special classes of regular sets. More p...
Jürgen Dassow, Florin Manea, Bianca Truthe
TSP
2008
132views more  TSP 2008»
14 years 11 months ago
Differential Modulations for Multinode Cooperative Communications
Abstract--This paper proposes and analyzes differential modulation schemes for two cooperation protocols in multinode cooperative wireless networks; namely, multinode differential ...
Thanongsak Himsoon, W. Pam Siriwongpairat, Weifeng...