Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
We are interested in the problem of validating the consistency of integrity constraints when data is modi ed. In particular, we consider how constraints can be checked with only p...
Jennifer Widom, Ashish Gupta, Yehoshua Sagiv, Jeff...
In abductive planning, plans are constructed as reasons for an agent to act: plans are demonstrations in logical theory of action that a goal will result assuming that given actio...
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
This paper addresses partial information spreading among n nodes of a network. As opposed to traditional information spreading, where each node has a message that must be received...
NTRU is a fast public key cryptosystem presented in 1996 by Hoffstein, Pipher and Silverman of Brown University. It operates in the ring of polynomials Z[X]/(XN − 1), where the ...
—This paper describes a novel framework, called Distributed Partial Information Management (or DPIM). It addresses several major challenges in achieving efficient shared path pr...
We discuss how to recover the private key for DSA style signature schemes if partial information about the ephemeral keys is revealed. The partial information we examine is of a se...
Abstract. Applying multi-agent systems in real world scenarios requires several essential research questions to be answered. Agents have to perceive their environment in order to t...
Frans C. A. Groen, Matthijs T. J. Spaan, Jelle R. ...
Uncertainty is a key issue in decision analysis and other kinds of applications. Researchers have developed a number of approaches to address computations on uncertain quantities....