62 search results - page 7 / 13 » Orthogonal Methods Based Ant Colony Search for Solving Conti... |
136
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
127
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
148
click to vote
ICUMT
2009
15 years 25 days ago
2009
This paper introduces a Combinatory Optimization Problem (COP) which captures the performance in cooperation of a P2P Streaming Network, considered at the buffer level. A new famil...
135
click to vote
GLOBECOM
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequency-division mult...
138
click to vote
LION
2009
Springer
15 years 9 months ago
2009
Springer
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...