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...
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
In this paper we investigate extensions of the well-known Vickrey-Clarke-Groves (VCG) mechanisms to problems whose objective function is not utilitarian and whose agents’ utiliti...
Giovanna Melideo, Paolo Penna, Guido Proietti, Rog...
Abstract The Firing Squad Synchronization Problem is one of the classical problems for cellular automata. In this paper we consider the case of more than one general. A synchronous...
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...