144 search results - page 16 / 29 » Constraint Propagation in Graph Coloring |
ICCAD
2001
IEEE
14 years 4 months ago
2001
IEEE
Tight data- and timing constraints are imposed by communication and multimedia applications. The architecture for the embedded processor imply resource constraints. Instead of ran...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
FLAIRS
2004
13 years 9 months ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
ICMCS
2009
IEEE
13 years 5 months ago
2009
IEEE
We proposed a new foreground detection method using the static cameras. It merges multi-modality into graph cut energy function, and performs much better results than conventional...
SPAA
2003
ACM
14 years 23 days ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...