106 search results - page 3 / 22 » Further Results on Swarms Solving Graph Coloring |
178
Voted
IJAMCIGI
2010
15 years 1 months ago
2010
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
180
Voted
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
173
Voted
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
140
Voted
DATE
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper presents an algorithmic technique based on hybridizing Symbolic Manipulation Techniques based on BDDs with more traditional Explicit solving algorithms. To validate the...
156
click to vote
COMPGEOM
1999
ACM
15 years 10 months ago
1999
ACM
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...