4934 search results - page 136 / 987 » complexity 2008 |
134
click to vote
AAAI
2008
15 years 6 months ago
2008
Particle filtering algorithms can be used for the monitoring of dynamic systems with continuous state variables and without any constraints on the form of the probability distribu...
144
click to vote
AAAI
2008
15 years 6 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
126
click to vote
AIPS
2008
15 years 6 months ago
2008
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
132
click to vote
ALGOSENSORS
2008
Springer
15 years 6 months ago
2008
Springer
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
136
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...