2354 search results - page 208 / 471 » Randomness, Stochasticity and Approximations |
117
click to vote
CP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We study the problem of maximizing the amount of stochastic diffusion in a network by acquiring nodes within a certain limited budget. We use a Sample Average Approximati...
158
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
We address the consensus-based distributed linear filtering problem, where a discrete time, linear stochastic process is observed by a network of sensors. We assume that the consen...
205
click to vote
JCO
2006
15 years 4 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
149
click to vote
PPAM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
155
Voted
SODA
2008
ACM
15 years 6 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...