4894 search results - page 703 / 979 » The Guarding Problem - Complexity and Approximation |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Bayes statistics and statistical physics have the common mathematical structure, where the log likelihood function corresponds to the random Hamiltonian. Recently, it was discovere...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...