881 search results - page 50 / 177 » Solving satisfiability problems with preferences |
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
ATAL
2006
Springer
14 years 14 days ago
2006
Springer
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
EVOW
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
DAM
2008
13 years 8 months ago
2008
We present here a systematic study of general boundary value problems on weighted networks that includes the variational formulation of such problems. In particular, we obtain the...
WEA
2010
Springer
14 years 1 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...