14158 search results - page 208 / 2832 » Generalized switch-setting problems |
155
Voted
WSNA
2003
ACM
15 years 8 months ago
2003
ACM
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
119
Voted
CPM
1999
Springer
15 years 8 months ago
1999
Springer
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
147
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
123
click to vote
IJCAI
2003
15 years 5 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
169
Voted
PODC
2009
ACM
16 years 4 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...