4894 search results - page 557 / 979 » The Guarding Problem - Complexity and Approximation |
143
click to vote
ICGI
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
128
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
We present collaborative peer-to-peer algorithms for the problem of approximating frequency counts for popular items distributed across the peers of a large-scale network. Our alg...
148
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
We present new insights into how to achieve higher frequencies in large-scale nonlinear predictive control using truncated-like schemes. The basic idea is that, instead of solving ...
187
click to vote
JMLR
2010
14 years 11 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
180
click to vote
INFOCOM
2011
IEEE
14 years 8 months ago
2011
IEEE
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...