350 search results - page 68 / 70 » Complexity of Planning with Partial Observability |
PROMISE
2010
13 years 2 months ago
2010
Background: Defects are related to failures and they do not have much power for indicating a higher quality or a better system above the baseline that the end-users expect. Nevert...
EDBT
2011
ACM
12 years 11 months ago
2011
ACM
A question that database administrators (DBAs) routinely need to answer is how long a batch query workload will take to complete. This question arises, for example, while planning...
HPCA
2009
IEEE
14 years 8 months ago
2009
IEEE
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...
SIGMOD
2002
ACM
14 years 8 months ago
2002
ACM
Peer-to-Peer (P2P) systems are becoming increasingly popular as they enable users to exchange digital information by participating in complex networks. Such systems are inexpensiv...
FASE
2009
Springer
14 years 2 months ago
2009
Springer
Reuse of existing libraries simplifies software development efforts. However, these libraries are often complex and reusing the APIs in the libraries involves a steep learning cu...