465 search results - page 9 / 93 » On the Hardness of Range Assignment Problems |
COR
2010
14 years 9 months ago
2010
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
92
Voted
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
The Frequency Assignment Problem (FAP) is one of the key issues in the design of GSM networks (Global System for Mobile communications), and will remain important in the foreseeab...
IPL
2006
14 years 9 months ago
2006
Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over Q. We prove that unless NPBPP Max-Satisfy c...
DAC
1997
ACM
15 years 1 months ago
1997
ACM
We present a system-level approach for power optimization under a set of user specified costs and timing constraints of hard real-time designs. The approach optimizes all three d...
EVOW
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics ...