10988 search results - page 54 / 2198 » Algorithmic Folding Complexity |
AAAI
2007
13 years 11 months ago
2007
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...
VTC
2008
IEEE
14 years 3 months ago
2008
IEEE
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...
FLAIRS
2003
13 years 10 months ago
2003
Researchers studying Evolutionary Algorithms and their applications have always been confronted with the sample complexity problem. The relationship between population size and gl...
ISAAC
2001
Springer
14 years 1 months ago
2001
Springer
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...
BIBE
2009
IEEE
14 years 11 days ago
2009
IEEE
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...