Sciweavers

FGCS
2000
90views more  FGCS 2000»
13 years 11 months ago
An ANTS heuristic for the frequency assignment problem
The problem considered in this paper consists in defining an assignment of frequencies to radio links, to be established between base stations and mobile transmitters, which minim...
Vittorio Maniezzo, Antonella Carbonaro
COR
2007
143views more  COR 2007»
13 years 11 months ago
A memetic algorithm for channel assignment in wireless FDMA systems
A new problem encoding is devised for the minimum span frequency assignment problem in wireless communications networks which is compact and general. Using the new encoding, which...
Sung-Soo Kim, Alice E. Smith, Jong-Hyun Lee
ISLPED
2010
ACM
158views Hardware» more  ISLPED 2010»
13 years 11 months ago
Temperature- and energy-constrained scheduling in multitasking systems: a model checking approach
The ongoing scaling of semiconductor technology is causing severe increase of on-chip power density and temperature in microprocessors. This has raised urgent requirement for both...
Weixun Wang, Xiaoke Qin, Prabhat Mishra
GECCO
2008
Springer
127views Optimization» more  GECCO 2008»
14 years 15 days ago
Metaheuristics for solving a real-world frequency assignment problem in GSM networks
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...
Francisco Luna, César Estébanez, Cor...
GECCO
2010
Springer
168views Optimization» more  GECCO 2010»
14 years 3 months ago
Elementary landscapes of frequency assignment problems
We analyze various forms of the Frequency Assignment Problem using the theory of elementary landscapes. We show that three variants of the Frequency Assignment Problem are either ...
L. Darrell Whitley, J. Francisco Chicano, Enrique ...
IWANN
2001
Springer
14 years 3 months ago
A Comparison of Several Evolutionary Heuristics for the Frequency Assignment Problem
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...
Carlos Cotta, José M. Troya
MFCS
2007
Springer
14 years 5 months ago
Exact Algorithms for L (2, 1)-Labeling of Graphs
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
Jan Kratochvíl, Dieter Kratsch, Mathieu Lie...
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
14 years 6 months ago
Three Results on Frequency Assignment in Linear Cellular Networks
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
Marek Chrobak, Jiri Sgall