Sciweavers

9325 search results - page 210 / 1865
» The decentralized implementability problem
Sort
View
ICDIM
2007
IEEE
15 years 9 months ago
A novel Variable Neighborhood Particle Swarm Optimization for multi-objective Flexible Job-Shop Scheduling Problems
This paper introduces a hybrid metaheuristic, the Variable Neighborhood Particle Swarm Optimization (VNPSO), consisting of a combination of the Variable Neighborhood Search (VNS) ...
Hongbo Liu, Ajith Abraham, Crina Grosan
LPAR
2005
Springer
15 years 8 months ago
A New Constraint Solver for 3D Lattices and Its Application to the Protein Folding Problem
Abstract. The paper describes the formalization and implementation of an efficient constraint programming framework operating on 3D crystal lattices. The framework is motivated an...
Alessandro Dal Palù, Agostino Dovier, Enric...
ANTSW
2004
Springer
15 years 8 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...
PDP
2003
IEEE
15 years 8 months ago
A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem
The paper presents a Coarse-Grained Multicomputer algorithm that solves the Longest Common Subsequence Problem. This algorithm can be implemented in the CGM with È processors in ...
Thierry Garcia, Jean Frédéric Myoupo...
115
Voted
TACAS
2010
Springer
251views Algorithms» more  TACAS 2010»
15 years 8 months ago
Approximating the Pareto Front of Multi-criteria Optimization Problems
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
Julien Legriel, Colas Le Guernic, Scott Cotton, Od...