Sciweavers

14 search results - page 2 / 3
» An ANTS heuristic for the frequency assignment problem
Sort
View
TEC
2002
163views more  TEC 2002»
13 years 4 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
GECCO
2006
Springer
287views Optimization» more  GECCO 2006»
13 years 9 months ago
A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
Yiliang Xu, Meng-Hiot Lim, Yew-Soon Ong, Jing Tang
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
13 years 5 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle
ICCD
2007
IEEE
98views Hardware» more  ICCD 2007»
14 years 2 months ago
Priority-monotonic energy management for real-time systems with reliability requirements
Considering the impact of the popular energy management technique Dynamic Voltage and Frequency Scaling (DVFS) on system reliability, the Reliability-Aware Power Management (RA-PM...
Dakai Zhu, Xuan Qi, Hakan Aydin
SECON
2010
IEEE
13 years 3 months ago
Leveraging Cognitive Radios for Effective Communications over Water
Wireless communications over water may suffer from serious multipath fading due to strong specular reflections from conducting water surfaces. Cognitive radios enable dynamic spect...
Jian Tang, Li Zhang, Richard S. Wolff, Weiyi Zhang