Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
Michael Bauland, Philippe Chapdelaine, Nadia Creig...
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has a...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
How children go about learning the general regularities that govern language, as well as keeping track of the exceptions to them, remains one of the challenging open questions in ...
Function Point Analysis (FPA) is among the most commonly used techniques to estimate the size of software system projects or software systems. During the point counting process th...