We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
― Self-assembly systems in space are arguably within the reach of today’s technology based on the research and development of self-reconfigurable robots on earth. This paper pr...
Nowadays, there is a need for smart learning environments that offer personal services with capabilities to learn, reason, have autonomy and be totally dynamic. In this paper, we p...
Abstract. We present the main features of a system designed to support the development and delivery of web applications through concepts for modularity, reuse and rapid prototyping...
This paper presents a class of fundamental control policies suitable for use in a novel method for designing and specifying the dynamic motion of robotic systems. Through recourse...