4894 search results - page 621 / 979 » The Guarding Problem - Complexity and Approximation |
162
click to vote
AIPS
2006
15 years 5 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
188
click to vote
SIROCCO
1997
15 years 5 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
143
click to vote
AI
2008
Springer
15 years 4 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
130
click to vote
AMCS
2010
15 years 4 months ago
2010
satisfactory network connectivity have dominated this line of research and abstracted away from the mathematical description of the physical processes underlying the observed pheno...
138
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
In this paper we consider a unified framework for parameter estimation problems which arise in a system identification context. In this framework, the parameters to be estimated a...