769 search results - page 111 / 154 » Where Is the Proof |
CONEXT
2008
ACM
13 years 11 months ago
2008
ACM
Replication is widely used in unstructured peer-to-peer systems to improve search or achieve availability. We identify and solve a subclass of replication problems where each obje...
ESOP
2008
Springer
13 years 11 months ago
2008
Springer
In this work we address the problem of proving, by static analysis means, that allocating and deallocating regions in the store provides a safe way to achieve memory management. Th...
CCCG
2007
13 years 11 months ago
2007
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...
DBSEC
2008
13 years 11 months ago
2008
Current security mechanisms are not suitable for organisations that outsource their data management to untrusted servers. Encrypting and decrypting sensitive data at the client si...
NIPS
2007
13 years 11 months ago
2007
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...