Sciweavers

266 search results - page 13 / 54
» A greedy genetic algorithm for the quadratic assignment prob...
Sort
View
HPCC
2005
Springer
14 years 2 months ago
Parallel Branch and Bound Algorithms on Internet Connected Workstations
By the use of the GRIBB software for distributed computing across the Internet, we are investigating the obstacles and the potential for efficient parallelization of Branch and Bou...
Randi Moe, Tor Sørevik
WICON
2008
13 years 10 months ago
Channel assignment with partially overlapping channels in wireless mesh networks
Many efforts have been devoted to maximizing the network throughput with limited channel resources in multi-radio multi-channel wireless mesh networks. It has been believed that t...
Yong Ding, Yi Huang, Guo-Kai Zeng, Li Xiao
JPDC
1998
125views more  JPDC 1998»
13 years 8 months ago
Solving Large-Scale QAP Problems in Parallel with the Search Library ZRAM
Programlibraries are one tool to make the cooperation between specialists from various elds successful: the separation of application-speci c knowledge from applicationindependent...
Adrian Brüngger, Ambros Marzetta, Jens Clause...
GECCO
2004
Springer
284views Optimization» more  GECCO 2004»
14 years 2 months ago
Lagrange Multiplier Method for Multi-campaign Assignment Problem
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...
Yong-Hyuk Kim, Byung Ro Moon
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
13 years 9 months ago
Coordinate change operators for genetic algorithms
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
Elizabeth F. Wanner, Eduardo G. Carrano, Ricardo H...