Sciweavers

266 search results - page 16 / 54
» A greedy genetic algorithm for the quadratic assignment prob...
Sort
View
MP
2010
163views more  MP 2010»
15 years 15 days ago
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
Christoph Buchheim, Frauke Liers, Marcus Oswald
IWCMC
2009
ACM
15 years 10 months ago
Scheduling cooperative emergency response: or how the meek shall overcome the greedy
We consider the problem of scheduling emergency responders to geospatially located finite duration temporally bounded tasks. We consider two different schedulers, Greedy and Mee...
Carol Dottin, Bilal Khan
ISCIS
2009
Springer
16 years 8 days ago
Channel assignment problem in cellular networks: A reactive tabu search approach
—The channel assignment problem (CAP) in cellular networks is concerned with the allocation and reuse of the frequency spectrum to the base stations in such a way that both the i...
Didem Gözüpek, Gaye Genç, Cem Ers...
EVOW
2005
Springer
15 years 11 months ago
On the Application of Evolutionary Algorithms to the Consensus Tree Problem
Computing consensus trees amounts to finding a single tree that summarizes a collection of trees. Three evolutionary algorithms are defined for this problem, featuring characteri...
Carlos Cotta
DCC
2010
IEEE
16 years 18 days ago
On Computation of Performance Bounds of Optimal Index Assignment
Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intac...
Xiaolin Wu, Hans D. Mittelmann, Xiaohan Wang, Jia ...