Results 1 to 10 of about 36,227 (305)
Genetic algorithms for graph partitioning and incremental graph partitioning
Proceedings of Supercomputing '94, 1994 Partitioning graphs into equally large groups of nodes, minimizing the number of edges between different groups, is an extremely important problem in parallel computing.
Sanjay Ranka +7 more
core +3 more sources
BiN-EdgePruning: edge pruning based on biased neighborhoods for printed circuit netlists [PDF]
PeerJ Computer ScienceAutomatic schematic generation is a key aspect of reverse engineering for printed circuit boards, and its cost is usually proportional to the size of the circuit.
Jie Yang +6 more
doaj +2 more sources
Élaboration d'une nouvelle métaheuristique pour le partitionnement de graphe : la méthode de fusion-fission. Application au découpage de l'espace aérien [PDF]
, 2007 Dans cette thèse, nous étudions des méthodes de partitionnement de graphe et les appliquons au découpage de l'espace aérien, ainsi qu'à d'autres problèmes. L'espace aérien est composé de volumes limités, appelés secteurs de contrôle, chacun étant sous la
Bichot, Charles-Edmond
core
GraSP: distributed streaming graph partitioning
, 2015 This paper presents a distributed, streaming graph parti- tioner, Graph Streaming Partitioner (GraSP), which makes partition decisions as each vertex is read from memory, sim- ulating an online algorithm that must process nodes as they arrive.
Pienta, Pienta +5 more
core +1 more source
A Partitioning and Index Algorithm for RDF Data of Cloud-Based Robotic Systems
IEEE Access, 2018 Robotic systems generally employ resource description framework (RDF) to express heterogeneous data coming from different sensors. With the access of more terminals, the RDF volume in robotic systems is becoming larger and larger, posing new significant ...
Yonglin Leng +3 more
doaj +1 more source
Improved Algorithm of Graph Partitioning Structure Detection Based on Minimum Description Length [PDF]
Jisuanji gongcheng, 2016 Aiming at the disadvantages of the existing Graph Partitioning Change Detection(GPCD) algorithm like repeated segmentation and ignoring change cost of images,it employs probabilistic trees to represent probabilistic models of graph partitioning ...
WEI Changbao,YAO Ruxian
doaj +1 more source
Data Science and Engineering, 2019 The coarse-grained multicomputer parallel model (CGM for short) has been used for solving several classes of dynamic programming problems. In this paper, we propose a parallel algorithm on the CGM model, with p processors, for solving the optimal binary ...
Vianney Kengne Tchendji +1 more
doaj +1 more source
IEEE Access, 2022 The usage of RISC-based embedded processors, aimed at low cost and low power, is becoming an increasingly popular ecosystem for both hardware and software development.
Erez Manor, Shlomo Greenberg
doaj +1 more source
ViAGraph : a Tool for Graph Visualization and Analysis [PDF]
, 2006 Graphs are common representations that can capture the structure and then can model a wide range of data and knowledge. In this paper, we present and discuss the functionalities of ViAGraph a tool for graph visualization and analysis.
Truong, Quoc Dinh, Dkaki, Taoufiq
core
PACC: Large scale connected component computation on Hadoop and Spark.
PLoS ONE, 2020 A connected component in a graph is a set of nodes linked to each other by paths. The problem of finding connected components has been applied to diverse graph analysis tasks such as graph partitioning, graph compression, and pattern recognition. Several
Ha-Myung Park +3 more
doaj +1 more source