1977 search results - page 193 / 396 » The satisfactory partition problem |
159
click to vote
AAAI
2010
15 years 8 months ago
2010
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
190
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
197
click to vote
NETWORKS
2007
15 years 6 months ago
2007
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
211
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Ensemble clustering has emerged as an important elaboration of the classical clustering problems. Ensemble clustering refers to the situation in which a number of different (input)...
184
click to vote
CSE
2009
IEEE
15 years 4 months ago
2009
IEEE
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...