Sciweavers

4112 search results - page 27 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
15 years 2 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache
IOR
2006
93views more  IOR 2006»
15 years 1 months ago
A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with di...
Alberto Ceselli, Giovanni Righini
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
15 years 5 months ago
Dominance learning in diploid genetic algorithms for dynamic optimization problems
This paper proposes an adaptive dominance mechanism for diploidy genetic algorithms in dynamic environments. In this scheme, the genotype to phenotype mapping in each gene locus i...
Shengxiang Yang
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 2 months ago
Algorithmic Solutions for Several Offline Constrained Resource Processing and Data Transfer Multicriteria Optimization Problems
In this paper we present novel algorithmic solutions for several resource processing and data transfer multicriteria optimization problems. The results of most of the presented tec...
Mugurel Ionut Andreica, Nicolae Tapus
NIPS
2004
15 years 3 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp