Sciweavers

440 search results - page 44 / 88
» Local Search Heuristics for the Multidimensional Assignment ...
Sort
View
ANTSW
2004
Springer
14 years 1 months ago
A Comparison Between ACO Algorithms for the Set Covering Problem
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
Lucas Lessing, Irina Dumitrescu, Thomas Stütz...
BICOB
2010
Springer
14 years 16 days ago
A Grid-Enabled Problem Solving Environment for QTL Analysis in R
We present a grid-enabled problem solving environment (PSE), for multidimensional QTL analysis. The concept of a computational grid has not been fully realized within this and oth...
Mahen Jayawardena, Carl Nettelblad, Salman Zubair ...
INFOCOM
2008
IEEE
14 years 2 months ago
Adding Capacity Points to a Wireless Mesh Network Using Local Search
Abstract— Wireless mesh network deployments are popular as a cost-effective means to provide broadband connectivity to large user populations. As the network usage grows, network...
Joshua Robinson, Mustafa Uysal, Ram Swaminathan, E...
ESWA
2007
100views more  ESWA 2007»
13 years 7 months ago
Using memetic algorithms with guided local search to solve assembly sequence planning
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
Hwai-En Tseng, Wen-Pai Wang, Hsun-Yi Shih
EVOW
2004
Springer
14 years 1 months ago
Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms
Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overla...
Enrique Alba, Bernabé Dorronsoro