543 search results - page 47 / 109 » A Multiagent Algorithm for Graph Partitioning |
APCSAC
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
ICDE
2010
IEEE
14 years 1 months ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering...
ICCAD
2001
IEEE
14 years 4 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
DCOSS
2007
Springer
14 years 2 months ago
2007
Springer
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...