In this paper, we consider the recognition problem on two classes of perfectly orderable graphs, namely, the HHD-free and the Welsh-Powell opposition graphs (or WPO-graphs). In par...
This communication deals with the Writer Identification task. Our previous work has shown the interest of using the graphemes as features for describing the individual properties ...
In Robotics, many path-planning algorithms have been proposed but almost all are evaluated only by their path lengths in PC. However, the evaluation is completely independent of a...
In this paper we discuss a model-based approach to verifying web service compositions for web service implementations. This approach provides verification of properties created fr...
Current hard real-time technologies are unable to support a new class of applications that have real-time constraints but with dynamic request arrivals and unpredictable resource r...