Sciweavers

349 search results - page 57 / 70
» Optimal Strategies for Reviewing Search Results
Sort
View
ESWA
2008
162views more  ESWA 2008»
15 years 6 months ago
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
Der-Fang Shiau, Shu-Chen Cheng, Yueh-Min Huang
NETWORKS
2008
15 years 6 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
15 years 10 months ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
15 years 11 months ago
Mirrored variants of the (1, 4)-CMA-ES compared on the noisy BBOB-2010 testbed
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ)and (1 + 2)-Evolution-Strategies (ESs) with the aim of designing fa...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
EUROSYS
2007
ACM
16 years 3 months ago
Competitive prefetching for concurrent sequential I/O
During concurrent I/O workloads, sequential access to one I/O stream can be interrupted by accesses to other streams in the system. Frequent switching between multiple sequential ...
Chuanpeng Li, Kai Shen, Athanasios E. Papathanasio...