360 search results - page 53 / 72 » Explanations and Proof Trees |
IPPS
2007
IEEE
14 years 4 months ago
2007
IEEE
We introduce a new model for distributed algorithms designed for large scale systems that need a low-overhead solution to allow the processes to communicate with each other. We as...
FOSSACS
2007
Springer
14 years 4 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
ILP
2007
Springer
14 years 4 months ago
2007
Springer
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
SIGECOM
2006
ACM
14 years 3 months ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
ISAAC
2004
Springer
14 years 3 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...