216 search results - page 32 / 44 » The Complexity of Planning Problems With Simple Causal Graph... |
ICAC
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we design, implement and evaluate AdaptGuard, a software service for guarding adaptive systems, such as QoS-adaptive servers, from instability caused by software an...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
ASIACRYPT
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
GIS
2010
ACM
13 years 5 months ago
2010
ACM
We consider the problem of automatically cleaning massive sonar data point clouds, that is, the problem of automatically removing noisy points that for example appear as a result ...