16404 search results - page 393 / 3281 » A set coverage problem |
174
click to vote
VLSID
2000
IEEE
15 years 9 months ago
2000
IEEE
We address the problem of verifying the correctness of pre-silicon models of a microprocessor. We touch on the latest advances in this area by considering two different aspects of...
183
click to vote
CAINE
2008
15 years 7 months ago
2008
Assembly is an NP-Hard problem, which involves comparing fragments that have a time complexity of O(n2 ). This paper presents a parallel approach for sequence assembly. The parall...
162
click to vote
IJCGA
2000
15 years 6 months ago
2000
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
174
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
177
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...