1977 search results - page 138 / 396 » The satisfactory partition problem |
189
click to vote
SOFSEM
2012
Springer
14 years 2 months ago
2012
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. While modelchecking theory has led to...
158
click to vote
IJCAI
2001
15 years 8 months ago
2001
We study the impact of backbones in optimization and approximation problems. We show that some optimization problems like graph coloring resemble decision problems, with problem h...
192
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
We address the problem of robust clustering by combining data partitions (forming a clustering ensemble) produced by multiple clusterings. We formulate robust clustering under an ...
167
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
Physical database design is important for query performance in a shared-nothing parallel database system, in which data is horizontally partitioned among multiple independent node...
157
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...