3172 search results - page 360 / 635 » On the Random-Self-Reducibility of Complete Sets |
148
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
153
click to vote
ECAI
1998
Springer
15 years 11 months ago
1998
Springer
In this paper we describe an approach for integrating abduction and induction in the ILP setting of learning from interpretations with the aim of solving the problem of incomplete...
158
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
We consider a general class of timed automata parameterized by a set of "input-determined" operators, in a continuous time setting. We show that for any such set of opera...
178
click to vote
TYPES
2000
Springer
15 years 10 months ago
2000
Springer
We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is a set of axioms for the constructive real numbers as used in the FTA (Fundamenta...
170
click to vote
AAAI
2006
15 years 8 months ago
2006
This paper is concerned with estimating the effects of actions from causal assumptions, represented concisely as a directed graph, and statistical knowledge, given as a probabilit...