2125 search results - page 274 / 425 » On Graph Complexity |
IWPEC
2004
Springer
15 years 3 months ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
ICRA
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper we present a probabilistic framework for the reduction in the uncertainty of a moving robot pose during exploration by using a second robot to assist. A Monte Carlo ...
AGTIVE
2003
Springer
15 years 3 months ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
AUSAI
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. In the philosophy of behavior-based robotics, design of complex behavior needs the interaction of basic behaviors that are easily implemented. Action selection mechanism ...
IWPC
2002
IEEE
15 years 3 months ago
2002
IEEE
Program understanding tools manipulate program represensuch as abstract syntax trees, control-flow graphs, or data-flow graphs. This paper deals with the use of visitor combinat...