Sciweavers

1589 search results - page 96 / 318
» Multiple-Goal Heuristic Search
Sort
View
AAAI
1997
15 years 4 months ago
Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
Aaron A. Armstrong, Edmund H. Durfee
IJMC
2006
84views more  IJMC 2006»
15 years 3 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
130
Voted
LION
2009
Springer
203views Optimization» more  LION 2009»
15 years 9 months ago
Position-Guided Tabu Search Algorithm for the Graph Coloring Problem
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
CPAIOR
2008
Springer
15 years 5 months ago
Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a complete, constructive search technique that has been shown to out-perform standard constructive search techniques on ...
Ivan Heckman, J. Christopher Beck
CEC
2003
IEEE
15 years 7 months ago
Phylogenetic trees using evolutionary search: initial progress in extending Gaphyl to work with genetic data
AbstractGaphyl is an application of evolutionary algorithms (EA's) to phylogenetics, an approach used by biologists to investigate evolutionary relationships among organisms. ...
Clare Bates Congdon, Kevin J. Septor