Sciweavers

234 search results - page 7 / 47
» The Complexity of Global Cardinality Constraints
Sort
View
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
13 years 7 days ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
AAAI
2008
15 years 4 days ago
The Parameterized Complexity of Global Constraints
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich...
ISAAC
2005
Springer
109views Algorithms» more  ISAAC 2005»
15 years 3 months ago
On the Complexity of Global Constraint Satisfaction
Cristina Bazgan, Marek Karpinski
CSCLP
2008
Springer
14 years 11 months ago
Combining Symmetry Breaking and Global Constraints
Abstract. We propose a new family of constraints which combine together lexicographical ordering constraints for symmetry breaking with other common global constraints. We give a g...
George Katsirelos, Nina Narodytska, Toby Walsh
ICDE
2012
IEEE
216views Database» more  ICDE 2012»
13 years 8 days ago
Load Balancing in MapReduce Based on Scalable Cardinality Estimates
—MapReduce has emerged as a popular tool for distributed and scalable processing of massive data sets and is increasingly being used in e-science applications. Unfortunately, the...
Benjamin Gufler, Nikolaus Augsten, Angelika Reiser...