1607 search results - page 147 / 322 » The existence of k-radius sequences |
IWOCA
2009
Springer
14 years 5 months ago
2009
Springer
A circuit in a simple undirected graph G = (V, E) is a sequence of vertices {v1, v2, . . . , vk+1} such that v1 = vk+1 and {vi, vi+i} ∈ E for i = 1, . . . , k. A circuit C is sai...
SARA
2009
Springer
14 years 5 months ago
2009
Springer
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...
SEMWEB
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Semantic applications that utilise OWL ontologies can benefit from a broad range of OWL reasoning systems, which allow for the inference of implicit knowledge from expli...
CDC
2008
IEEE
14 years 4 months ago
2008
IEEE
— The Tunnel-MILP algorithm is a three stage path planning method for 2-D environments that relies on the identification of a sequence of convex polygons to form an obstacle fre...
DELTA
2008
IEEE
14 years 4 months ago
2008
IEEE
Efficient generation of random and pseudorandom sequences is of great importance to a number of applications [4]. In this paper, an efficient implementation of the Mersenne Twis...