This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
RecentlyFtwo new backtracking algorithmsF dynamic backtracking (DB)and partial order dynamicbacktracking (PDB) have been presented. These algorithms have the property to be additi...
This paper deals with the problem of finding upper bounds on the number of periodic solutions of a class of one-dimensional non-autonomous differential equations: those with the r...
Abstract. New enumerating functions for the Euler numbers are considered. Several of the relevant generating functions appear in connection to entries in Ramanujan’s Lost Noteboo...