1951 search results - page 379 / 391 » An algorithm for improving graph partitions |
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
BIRTHDAY
2009
Springer
15 years 4 months ago
2009
Springer
We present a new hybrid BDD and SAT-based algorithm for model checking. Our algorithm is based on backward search, where each pre-image computation consists of an efficient All-SA...
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
110
click to vote
WADS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...