1951 search results - page 220 / 391 » An algorithm for improving graph partitions |
155
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
A major research challenge in multi-agent systems is the problem of partitioning a set of agents into mutually disjoint coalitions, such that the overall performance of the system...
139
click to vote
BMCBI
2005
15 years 5 months ago
2005
Background: In a previous report (La et al., Proteins, 2005), we have demonstrated that the identification of phylogenetic motifs, protein sequence fragments conserving the overal...
146
click to vote
APPROX
2009
Springer
16 years 3 days ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
161
click to vote
TCOM
2011
15 years 14 days ago
2011
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
129
click to vote
SIGIR
2006
ACM
15 years 11 months ago
2006
ACM
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...