1816 search results - page 61 / 364 » A New Approach for Solving the Maximum Clique Problem |
149
click to vote
TSP
2010
15 years 17 days ago
2010
A parametric generalized likelihood ratio test (GLRT) for multichannel signal detection in spatially and temporally colored disturbance was recently introduced by modeling the dist...
152
click to vote
ASIAMS
2008
IEEE
16 years 11 days ago
2008
IEEE
The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possibl...
174
click to vote
COCOON
2010
Springer
15 years 9 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
184
click to vote
COLOGNETWENTE
2010
15 years 2 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
210
click to vote
RSP
1998
IEEE
15 years 10 months ago
1998
IEEE
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...