Sciweavers

1027 search results - page 54 / 206
» Comparing Search Algorithms for the Temperature Inversion Pr...
Sort
View
ICGA
1993
75views Optimization» more  ICGA 1993»
13 years 9 months ago
Structure and Performance of Fine-Grain Parallelism in Genetic Search
Within the parallel genetic algorithm framework, there currently exists a growing dichotomy between coarse-pain and fine-grain parallel architectures. This paper attempts to chara...
Shumeet Baluja
DCC
2002
IEEE
14 years 7 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
14 years 2 months ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
14 years 2 months ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank
AMC
2005
136views more  AMC 2005»
13 years 7 months ago
Solving a dynamic cell formation problem using metaheuristics
In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed by using some traditional metaheuristic methods such as genetic algorithm (GA), ...
Reza Tavakkoli-Moghaddam, M. B. Aryanezhad, Nima S...