1331 search results - page 214 / 267 » Complexity bounds for zero-test algorithms |
ICLP
1999
Springer
15 years 2 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
ISAAC
1998
Springer
15 years 2 months ago
1998
Springer
Casting is a manufacturing process in which liquid is poured into a cast (mould) that has a cavity with the shape of the object to be manufactured. The liquid then hardens, after ...
AAAI
2007
15 years 2 days ago
2007
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
DAGSTUHL
2006
14 years 11 months ago
2006
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...
105
click to vote
JAIR
2008
14 years 9 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...