Sciweavers

42230 search results - page 212 / 8446
» Algorithms and Complexity Results for
Sort
View
AAAI
2007
15 years 9 months ago
A Reinforcement Learning Algorithm with Polynomial Interaction Complexity for Only-Costly-Observable MDPs
An Unobservable MDP (UMDP) is a POMDP in which there are no observations. An Only-Costly-Observable MDP (OCOMDP) is a POMDP which extends an UMDP by allowing a particular costly a...
Roy Fox, Moshe Tennenholtz
TIT
2010
124views Education» more  TIT 2010»
15 years 1 months ago
Soft-input soft-output single tree-search sphere decoding
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for prac...
Christoph Studer, Helmut Bölcskei
VTC
2008
IEEE
16 years 28 days ago
Reduced-Complexity Adaptive Receiver Algorithms for 4G SU-MIMO Systems
Abstract—In this paper we present reduced-complexity highperformance receivers for single-user MIMO systems that employ coded OFDM transmission with bit-interleaved coded modulat...
Ozgun Y. Bursalioglu, Haralabos C. Papadopoulos, C...
FLAIRS
2003
15 years 8 months ago
Sample Complexity of Real-Coded Evolutionary Algorithms
Researchers studying Evolutionary Algorithms and their applications have always been confronted with the sample complexity problem. The relationship between population size and gl...
Jian Zhang 0007, Xiaohui Yuan, Bill P. Buckles
ISAAC
2001
Springer
98views Algorithms» more  ISAAC 2001»
15 years 11 months ago
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
Hideaki Hori, Shinichi Shimozono, Masayuki Takeda,...