986 search results - page 102 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
193
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
160
click to vote
JAIR
2008
15 years 6 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
184
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
164
click to vote
TMC
2008
15 years 6 months ago
2008
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...
194
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract-- In this paper we consider the problem of monitoring a known set of stationary features (or locations of interest) in an environment. To observe a feature, a robot must v...