6251 search results - page 1111 / 1251 » Randomness, Computability, and Density |
140
click to vote
SPIRE
2010
Springer
15 years 2 months 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...
139
click to vote
TCOM
2010
15 years 2 months 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...
157
click to vote
WDAG
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
219
click to vote
BIOCOMP
2010
15 years 2 months ago
2010
Abstract-- Modeling the intermolecular reactions in a single cell is a critical problem in computational biology. Biochemical reaction systems often involve species in both low and...
137
click to vote
EVOW
2010
Springer
15 years 2 months ago
2010
Springer
One of the open questions in evolutionary computation is how an arms race may be initiated between coevolving entities such that the entities acquire new behaviors and increase in ...