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...
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...
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...
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...
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...