16596 search results - page 32 / 3320 » Generalized Assignment Problems |
IWANN
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. The Frequency Assignment Problem (FAP) is a very important problem of practical interest. This work compares several evolutionary approaches to this problem, based both i...
104
click to vote
INFORMATICALT
2000
14 years 9 months ago
2000
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic a...
129
Voted
DISOPT
2011
14 years 1 months ago
2011
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
120
Voted
OL
2011
14 years 4 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
110
click to vote
SOCC
2008
IEEE
15 years 4 months ago
2008
IEEE
— Scaling down the voltage levels of the processing elements (PEs) in a Network-on-Chip (NoC) can significantly reduce the computation energy consumption with an overhead of the...