Sciweavers

1984 search results - page 3 / 397
» The colourful feasibility problem
Sort
View
BMVC
1998
13 years 11 months ago
Colour Profiling Using Multiple Colour Spaces
This paper presents an original method using colour histograms for flaw detection in automated industrial inspection. The colour histogram of an image is constructed by mapping th...
Nicola Duffy, Gerard Lacey
WG
2005
Springer
14 years 3 months ago
Channel Assignment and Improper Choosability of Graphs
Abstract. We model a problem proposed by Alcatel, a satellite building company, using improper colourings of graphs. The relation between improper colourings and maximum average de...
Frédéric Havet, Jean-Sébastie...
HAIS
2009
Springer
14 years 2 months ago
Evolutionary Non-linear Great Deluge for University Course Timetabling
This paper presents a hybrid evolutionary algorithm to tackle university course timetabling problems. The proposed approach is an extension of a non-linear great deluge algorithm i...
Dario Landa Silva, Joe Henry Obit
CONCUR
2012
Springer
12 years 6 days ago
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
Guy Avni, Orna Kupferman
EVOW
2005
Springer
14 years 3 months ago
Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring
In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics ...
István Juhos, Attila Tóth, Jano I. v...