77 search results - page 1 / 16 » Using Genetic Algorithms to Solve the Tactical Fixed Interva... |
FLAIRS
2000
13 years 6 months ago
2000
IJIIP
2010
13 years 1 months ago
2010
IJMC
2006
13 years 4 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betw...