4131 search results - page 165 / 827 » The Generalized Max-Controlled Set Problem |
203
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
236
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without acc...
167
click to vote
TCS
2008
15 years 6 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
182
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
151
click to vote
ESA
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...