Sciweavers

14158 search results - page 27 / 2832
» Generalized switch-setting problems
Sort
View
ESA
2010
Springer
163views Algorithms» more  ESA 2010»
13 years 11 months ago
On the Huffman and Alphabetic Tree Problem with General Cost Functions
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...
Hiroshi Fujiwara, Tobias Jacobs
COR
2010
150views more  COR 2010»
13 years 10 months ago
Black box scatter search for general classes of binary optimization problems
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...
Francisco Gortázar, Abraham Duarte, Manuel ...
IFIP
2004
Springer
14 years 3 months ago
Truthful Mechanisms for Generalized Utilitarian Problems
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...
IFIP
2004
Springer
14 years 3 months ago
The Firing Squad Synchronization Problem with Many Generals For One-Dimensional CA
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...
Hubert Schmid, Thomas Worsch
ISLPED
2003
ACM
96views Hardware» more  ISLPED 2003»
14 years 3 months ago
Effective graph theoretic techniques for the generalized low power binding problem
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...
Azadeh Davoodi, Ankur Srivastava