The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
In this paper we present an approach for reducing the memory footprint requirement of temporal difference methods in which the set of states is finite. We use case-based generaliza...
Few works are available in the literature to define similarity criteria between First-Order Logic formulæ, where the presence of relations causes various portions of one descript...
Stefano Ferilli, Teresa Maria Altomare Basile, Nic...
In the field of Natural Language Processing, in order to work out a thematic representation system of general knowledge, methods relying on thesaurus have been used for about twen...
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...