Sciweavers

351 search results - page 2 / 71
» Evaluation of Different Metaheuristics Solving the RND Probl...
Sort
View
GECCO
2008
Springer
127views Optimization» more  GECCO 2008»
13 years 6 months 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...
AIR
2008
97views more  AIR 2008»
13 years 5 months ago
A design framework for metaheuristics
This paper is concerned with taking an engineering approach towards the application of metaheuristic problem solving methods, i.e. heuristics that aim to solve a wide variety of p...
Colin G. Johnson
NMA
2010
13 years 2 months ago
Metaheuristics for the Asymmetric Hamiltonian Path Problem
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
João Pedro Pedroso
ICCSA
2004
Springer
13 years 10 months ago
A Comparison Study of Metaheuristic Techniques for Providing QoS to Avatars in DVE Systems
Abstract. Network-server architecture has become a de-facto standard for Distributed Virtual Environment (DVE) systems. In these systems, a large set of remote users share a 3D vir...
Pedro Morillo, Juan M. Orduña, Marcos Fern&...
SAC
2004
ACM
13 years 10 months ago
Solving the maximum clique problem by k-opt local search
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihis...