Sciweavers

140 search results - page 26 / 28
» P3
Sort
View
ATAL
2010
Springer
13 years 6 months ago
Image based exploration for indoor environments using local features
d Abstract) Aravindhan K Krishnan Madhava Krishna Supreeth Achar This paper presents an approach to explore an unknown indoor environment using vision as the sensing modality, t...
Aravindhan K. Krishnan, K. Madhava Krishna, Supree...
CCCG
2009
13 years 6 months ago
Generalized jewels and the point placement problem
The point placement problem is to determine the positions of a linear set of points, P = {p1, p2, p3, . . . , pn}, uniquely, up to translation and reflection, from the fewest poss...
Md. Shafiul Alam, Asish Mukhopadhyay, Animesh Sark...
ATAL
2010
Springer
13 years 5 months ago
Verifying agents with memory is harder than it seemed
ATL+ is a variant of alternating-time temporal logic that does not have the expressive power of full ATL , but still allows for expressing some natural properties of agents. It ha...
Nils Bulling, Wojciech Jamroga
DM
2008
137views more  DM 2008»
13 years 5 months ago
Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
Let G = (V, E) be a graph. A set S V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V - S is adjacent to a vertex in V - S....
Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Jo...
WG
2010
Springer
13 years 3 months ago
Colouring Vertices of Triangle-Free Graphs
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is n...
Konrad Dabrowski, Vadim V. Lozin, Rajiv Raman, Ber...