The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the pro...
Abstract. We discuss the special requirements imposed on the underlying cipher of systems which encrypt each sector of a disk partition independently, and demonstrate a certificati...
In this paper we investigate the periodic structure of rich words (i.e., words having the highest possible number of palindromic factors), giving new results relating them with per...
The modern industrial facility depends on sensitive electronic equipment that can be shut down suddenly by severe power system disturbances. A large number of these disturbances o...
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approa...