588 search results - page 58 / 118 » Reducibility and Completeness in Private Computations |
ICRA
2008
IEEE
14 years 4 months ago
2008
IEEE
— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...
LFCS
2007
Springer
14 years 4 months ago
2007
Springer
Interval-based temporal logics are an important research area in computer science and artificial intelligence. In this paper we investigate decidability and expressiveness issues ...
ASP
2005
Springer
14 years 3 months ago
2005
Springer
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
ICLP
2005
Springer
14 years 3 months ago
2005
Springer
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its...
ENGL
2008
13 years 10 months ago
2008
This paper proposes a novel adaptive sliding mode control with PID tuning method for a class of uncertain systems. The goal is to achieve system robustness against parameter variat...