405 search results - page 32 / 81 » Using critical sets to solve the maximum independent set pro... |
ICDAR
2003
IEEE
14 years 28 days ago
2003
IEEE
This paper deals with an off-line Japanese signature verification using a pattern matching method. An annoying problem encountered in off-line signature verification using a patte...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Good algorithms exist for solving the strip packing problem when the objective is to minimise the amount of wasted material. We describe a multi-objective evolutionary algorith...
ATS
2005
IEEE
14 years 1 months ago
2005
IEEE
Power reduction during test application is important from the viewpoint of chip reliability and for obtaining correct test results. One of the ways to reduce scan test power is to...
EOR
2010
13 years 7 months ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
ANOR
2005
13 years 7 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...