106 search results - page 1 / 22 » Further Results on Swarms Solving Graph Coloring |
ICCSA
2010
Springer
13 years 3 months ago
2010
Springer
ICTCS
2005
Springer
13 years 10 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
PPAM
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...