6142 search results - page 14 / 1229 » The Complexity of Partition Functions |
CP
2009
Springer
14 years 8 months ago
2009
Springer
This paper presents a new way of formalizing the Coalition Structure Generation problem (CSG), so that we can apply constraint optimization techniques to it. Forming effective coal...
DM
2008
13 years 7 months ago
2008
A set partition is said to be (k, d)-noncrossing if it avoids the pattern 12
AAAI
2000
13 years 8 months ago
2000
The complexity of numerical domain partitioning depends on the number of potential cut points. In multiway partitioning this dependency is often quadratic, even exponential. There...
ITSL
2008
13 years 8 months ago
2008
We describe the first implementation of the Barvinok
JMMA
2010
13 years 2 months ago
2010
This paper follows a word-document co-clustering model independently introduced in 2001 by several authors such as I.S. Dhillon, H. Zha and C. Ding. This model consists in creatin...