2698 search results - page 222 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
148
click to vote
ISCAS
2005
IEEE
16 years 4 days ago
2005
IEEE
— Multidimensional or group independent component analysis describes the task of transforming a multivariate observed sensor signal such that groups of the transformed signal com...
177
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
172
click to vote
COLOGNETWENTE
2008
15 years 8 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
180
click to vote
ANOR
2004
15 years 6 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
177
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...