Sciweavers

336 search results - page 52 / 68
» Consultant-guided search algorithms for the quadratic assign...
Sort
View
ICMLA
2004
13 years 10 months ago
A new discrete binary particle swarm optimization based on learning automata
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
Reza Rastegar, Mohammad Reza Meybodi, Kambiz Badie
CIKM
2010
Springer
13 years 3 months ago
Exploiting hierarchical tags for context-awareness
Context-awareness for information retrieval is challenging problem as information about the users current situation is rarely available. If such information would be available, re...
Alan Said, Jérôme Kunegis, Ernesto Wi...
EOR
2007
198views more  EOR 2007»
13 years 8 months ago
Airline crew scheduling from planning to operations
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
Claude P. Medard, Nidhi Sawhney
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
14 years 2 months ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
Leon Poladian
AI
2005
Springer
13 years 8 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo