: An ellipsis resolution mechanism is presented. The mechanism is a part of a Natural Language Understanding System developed in the last years in order to be included as a main co...
We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem v...
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
This paper proposes an optimistic concurrency control (CC) algorithm, called Sequential Order with Dynamic Adjustment (SODA), that guarantees timely and correct execution of concu...
A framework for Colombian supermarkets challenges in order to find an adequate number of cashiers and baggers was developed, translated to a simulation model using Promodel