We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...
We present a new specification/implementation of the mobile agent language Mobile Maude. This new version uses the external sockets provided by Maude since its 2.2 version, thus ...
This paper presents an extension of Petri net framework with imprecise temporal properties. We use possibility theory to represent imprecise time by time-stamping tokens and assig...
A clothoid has the property that its curvature varies linearly with arclength. This is a useful feature for the path of a vehicle whose turning radius is controlled as a linear fu...