Sciweavers

2244 search results - page 35 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
128
Voted
PIMRC
2008
IEEE
16 years 14 days ago
Double Hopping: A new approach for Dynamic Frequency Hopping in Cognitive Radio networks
—One of the major challenges in designing cellular Cognitive Radio (CR) networks is the avoidance of Secondary User (SU) interference to so called Primary Users (PUs) operating i...
Daniel Willkomm, Mathias Bohge, Daniel Hollos, Jam...
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
15 years 7 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...
CEC
2005
IEEE
15 years 11 months ago
A hybrid model of evolutionary algorithms and branch-and-bound for combinatorial optimization problems
Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatib...
José E. Gallardo, Carlos Cotta, Antonio J. ...
ECAL
2007
Springer
16 years 7 days ago
Near-Optimal Mobile Robot Recharging with the Rate-Maximizing Forager
We examine the practical problem of a mobile autonomous robot performing a long-duration survey task, during which it must recharge its batteries periodically. We present a scalabl...
Jens Wawerla, Richard T. Vaughan
DAC
1995
ACM
15 years 9 months ago
Orthogonal Greedy Coupling - A New Optimization Approach to 2-D FPGA Routing
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a diffe...
Yu-Liang Wu, Malgorzata Marek-Sadowska