3897 search results - page 144 / 780 » complexity 2010 |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
ICRA
2010
IEEE
13 years 9 months ago
2010
IEEE
— This paper presents a multi-skill motion planner which is able to sequentially synchronize parameterized motion skills in order to achieve humanoid motions exhibiting complex w...
ICALP
2010
Springer
14 years 3 months ago
2010
Springer
We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We consider quantifier-free spatial logics, designed for qualitative spatial representation and reasoning in AI, and extend them with the means to represent topological c...
FSTTCS
2010
Springer
13 years 8 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...