879 search results - page 30 / 176 » Optimizing for Reduced Code Space using Genetic Algorithms |
114
Voted
COR
2007
15 years 1 months ago
2007
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...
118
click to vote
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...
CEC
2008
IEEE
15 years 8 months ago
2008
IEEE
— A number of multi-objective genetic algorithms (MOGAs) have been developed to obtain Pareto optimal solutions for multi-objective optimization problems. However, as these metho...
102
click to vote
ICSM
2006
IEEE
15 years 8 months ago
2006
IEEE
One approach to supporting program comprehension involves binding concepts to source code. Previously proposed approaches to concept binding have enforced nonoverlapping boundarie...
108
Voted
MONET
2008
15 years 1 months ago
2008
Genetic algorithms are best suited for optimization problems involving large search spaces. The problem space encountered when optimizing the transmission parameters of an agile or...