367 search results - page 45 / 74 » A memetic algorithm for graph coloring |
DAC
2009
ACM
14 years 3 months ago
2009
ACM
For a computing system to be trusted, it is equally important to verify that the system performs no more and no less functionalities than desired. Traditional testing and verifica...
COCOON
2009
Springer
14 years 3 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...
DISOPT
2010
13 years 9 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...