: The problem of view updatesin deductive databasesis studiedby casting this in anaturally associatedabductive framework.It is shownthat this abductiveapproachdeals successfully, i...
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...
Abstract-- We consider the problem of optimal netlist simplification in the presence of constraints. Because constraints restrict the reachable states of a netlist, they may enhanc...
It is part of the traditional lore of genetic algorithms that low mutation rates lead to efficient search of the solution space, while high mutation rates result in diffusion of s...
In this note the stability of a second-order quasi-polynomial with a single delay is studied. Although there is a vast literature on this problem, most available solutions are lim...