36 search results - page 1 / 8 » Improving Graph Colouring Algorithms and Heuristics Using a ... |
103
Voted
EVOW
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
102
Voted
EVOW
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics ...
102
Voted
EVOW
2004
Springer
15 years 6 months ago
2004
Springer
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...
87
Voted
EMNLP
2010
14 years 11 months ago
2010
Linguistic Steganography is concerned with hiding information in natural language text. One of the major transformations used in Linguistic Steganography is synonym substitution. ...
89
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
— This paper investigates the path protection problem in mesh networks under multiple generic risks. Disjoint logical links may fail simultaneously if they share the same compone...