128 search results - page 14 / 26 » Parallel Simulated Annealing Algorithm for Graph Coloring Pr... |
ECMDAFA
2010
Springer
14 years 9 days ago
2010
Springer
Dynamic UML models like sequence diagrams (SD) lack sufficient formal semantics, making it difficult to build automated tools for their analysis, simulation and validation. A commo...
ICIAP
2005
ACM
14 years 2 months ago
2005
ACM
This paper shows how Markovian segmentation algorithms used to solve well known computer vision problems such as motion estimation, motion detection and stereovision can be signiï¬...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
We propose a new solution to the problem of bilayer video segmentation in terms of both, hardware design and algorithmic solution. At the data acquisition stage, we combine color ...
PODC
2010
ACM
14 years 26 days ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
PC
2010
13 years 7 months ago
2010
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...