5138 search results - page 927 / 1028 » Randomized Algorithms for 3-SAT |
122
Voted
PE
2010
Springer
15 years 8 days ago
2010
Springer
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
119
click to vote
PKDD
2010
Springer
15 years 8 days ago
2010
Springer
Abstract. Bayesian reinforcement learning (RL) is aimed at making more efficient use of data samples, but typically uses significantly more computation. For discrete Markov Decis...
117
Voted
SPIRE
2010
Springer
15 years 7 days ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
TAP
2010
Springer
15 years 7 days ago
2010
Springer
raction, simplification, segmentation, illumination, rendering, and illustration. Even though this technique is inspired by models of low-level human vision, it has not yet been v...
120
click to vote
TCOM
2010
15 years 7 days ago
2010
Abstract—This paper considers the problem of Gaussian symbols detection in MIMO systems in the presence of channel estimation errors. Under this framework we develop a computatio...