874 search results - page 28 / 175 » Computing Weighted Solutions in Answer Set Programming |
87
Voted
ICTCS
2005
Springer
15 years 6 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
96
Voted
ICASSP
2010
IEEE
15 years 27 days ago
2010
IEEE
In this paper a novel approach for semi-supervised hyperspectral unmixing is presented. First, it is shown that this problem inherently accepts a sparse solution. Then, based on t...
95
Voted
ORL
1998
15 years 11 days ago
1998
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
133
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
DAC
2002
ACM
16 years 1 months ago
2002
ACM
Linear programming (LP) in its many forms has proven to be an indispensable tool for expressing and solving optimization problems in numerous domains. We propose the first set of ...