144 search results - page 17 / 29 » Constraint Propagation in Graph Coloring |
ENTCS
2006
13 years 7 months ago
2006
Model transformation means converting an input model available at the beginning of the transformation process to an output model. A widely used approach to model transformation us...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Non-adaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question...
IDEAL
2003
Springer
14 years 22 days ago
2003
Springer
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...
MFCS
1995
Springer
13 years 11 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
FGR
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper presents an algorithm for measuring hair and face appearance in 2D images. Our approach starts by using learned mixture models of color and location information to sugg...