STOC
2012
ACM
12 years 1 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
SIGMOD
2011
ACM
13 years 2 months ago
2011
ACM
We study the problem of generating synthetic databases having declaratively specified characteristics. This problem is motivated by database system and application testing, data ...
ANOR
2011
13 years 3 months ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
CP
2004
Springer
14 years 4 months ago
2004
Springer
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints in conjunction with cardi...
GECCO
2005
Springer
14 years 5 months ago
2005
Springer
A genetic algorithm encoding is proposed which is able to automatically satisfy a class of important cardinality constraints where the set of distinct values of the design variabl...
SAT
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We define new encodings from Max-CSP into Partial MaxSAT which are obtained by modelling the at-most-one condition with the sequential SAT encoding of the cardinality co...