Sciweavers

14739 search results - page 228 / 2948
» An optimization problem on the sphere
Sort
View
99
Voted
CP
1997
Springer
15 years 3 months ago
Distributed Partial Constraint Satisfaction Problem
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
Katsutoshi Hirayama, Makoto Yokoo
GECCO
2009
Springer
116views Optimization» more  GECCO 2009»
15 years 3 months ago
String- and permutation-coded genetic algorithms for the static weapon-target assignment problem
In the Weapon-Target Assignment Problem, m enemy targets are inbound, each with a value Vj representing the damage it may do. The defense has n weapons, and the probability that w...
Bryant A. Julstrom
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
15 years 2 months ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom
GECCO
2000
Springer
170views Optimization» more  GECCO 2000»
15 years 2 months ago
A Comparison of Genetic Algorithms for the Dynamic Job Shop Scheduling Problem
The majority of the research using evolutionary algorithms for the Job Shop Scheduling Problem (JSSP) has studied only the static JSSP. Few evolutionary algorithms have been appli...
Manuel Vázquez, L. Darrell Whitley
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
15 years 5 days ago
Voronoi-initializated island models for solving real-coded deceptive problems
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
Santiago Muelas, José Manuel Peña, V...