Gotowe bibliografie tematyczne / Multi-level graph partitioning

Spis treści

  1. Artykuły w czasopismach
  2. Rozprawy doktorskie
  3. Części książek
  4. Streszczenia konferencji

Gotowa bibliografia na temat „Multi-level graph partitioning”

Autor: Grafiati
Data publikacji: 6 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Multi-level graph partitioning”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Multi-level graph partitioning"

1

Fatih Talu, Muhammed. "Multi-level spectral graph partitioning method." Journal of Statistical Mechanics: Theory and Experiment 2017, no. 9 (2017): 093406. http://dx.doi.org/10.1088/1742-5468/aa85ba.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Moreira, Orlando, Merten Popp, and Christian Schulz. "Evolutionary multi-level acyclic graph partitioning." Journal of Heuristics 26, no. 5 (2020): 771–99. http://dx.doi.org/10.1007/s10732-020-09448-8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Pastukhov, R. K., A. V. Korshunov, D. Yu Turdakov, and S. D. Kuznetsov. "Improving quality of graph partitioning using multi-level optimization." Programming and Computer Software 41, no. 5 (2015): 302–6. http://dx.doi.org/10.1134/s0361768815050096.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Djidjev, Hristo N., Georg Hahn, Susan M. Mniszewski, Christian F. A. Negre, and Anders M. N. Niklasson. "Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics." Algorithms 12, no. 9 (2019): 187. http://dx.doi.org/10.3390/a12090187.

Pełny tekst źródła
Streszczenie:
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several advanced algorithms relying on evaluations of matrix polynomials have been published in the literature for such simulations. We aim to use a special type of graph partitioning to efficiently parallelize these computations. For this, we create a graph representing the zero–nonzero structure of a thresholded density matrix, and partition that graph into several co
Style APA, Harvard, Vancouver, ISO itp.
5

Li, Yong, Jinxing Li, Yu Sun, and Haisheng Li. "Load Balancing Based on Firefly and Ant Colony Optimization Algorithms for Parallel Computing." Biomimetics 7, no. 4 (2022): 168. http://dx.doi.org/10.3390/biomimetics7040168.

Pełny tekst źródła
Streszczenie:
With the wide application of computational fluid dynamics in various fields and the continuous growth of the complexity of the problem and the scale of the computational grid, large-scale parallel computing came into being and became an indispensable means to solve this problem. In the numerical simulation of multi-block grids, the mapping strategy from grid block to processor is an important factor affecting the efficiency of load balancing and communication overhead. The multi-level graph partitioning algorithm is an important algorithm that introduces graph network dynamic programming to so
Style APA, Harvard, Vancouver, ISO itp.
6

Ahmed, Nesreen, and Ryan Rossi. "Interactive Visual Graph Analytics on the Web." Proceedings of the International AAAI Conference on Web and Social Media 9, no. 1 (2021): 566–69. http://dx.doi.org/10.1609/icwsm.v9i1.14653.

Pełny tekst źródła
Streszczenie:
We present a web-based network visual analytics platform called GraphVis that combines interactive visualizations with analytic techniques to reveal important patterns and insights for sense making, reasoning, and decision-making. The platform is designed with simplicity in mind and allows users to visualize and explore networks in seconds with a simple drag-and-drop of a graph file into the web browser. GraphVis is fast and flexible, web-based, requires no installation, while supporting a wide range of graph formats as well as state-of-the-art visualization and analytic techniques. In particu
Style APA, Harvard, Vancouver, ISO itp.
7

Wan, Xinchen, Kaiqiang Xu, Xudong Liao, Yilun Jin, Kai Chen, and Xin Jin. "Scalable and Efficient Full-Graph GNN Training for Large Graphs." Proceedings of the ACM on Management of Data 1, no. 2 (2023): 1–23. http://dx.doi.org/10.1145/3589288.

Pełny tekst źródła
Streszczenie:
Graph Neural Networks (GNNs) have emerged as powerful tools to capture structural information from graph-structured data, achieving state-of-the-art performance on applications such as recommendation, knowledge graph, and search. Graphs in these domains typically contain hundreds of millions of nodes and billions of edges. However, previous GNN systems demonstrate poor scalability because large and interleaved computation dependencies in GNN training cause significant overhead in current parallelization methods. We present G3, a distributed system that can efficiently train GNNs over billion-e
Style APA, Harvard, Vancouver, ISO itp.
8

Deepthy, Dinesan, and Joseph Varghese Kureethara. "INDUCED \(nK_{2}\) DECOMPOSITION OF INFINITE SQUARE GRIDS AND INFINITE HEXAGONAL GRIDS." Ural Mathematical Journal 8, no. 1 (2022): 23. http://dx.doi.org/10.15826/umj.2022.1.003.

Pełny tekst źródła
Streszczenie:
The induced \(nK_2\) decomposition of infinite square grids and hexagonal grids are described here. We use the multi-level distance edge labeling as an effective technique in the decomposition of square grids. If the edges are adjacent, then their color difference is at least 2 and if they are separated by exactly a single edge, then their colors must be distinct. Only non-negative integers are used for labeling. The proposed partitioning technique per the edge labels to get the induced \(nK_2\) decomposition of the ladder graph is the square grid and the hexagonal grid.
Style APA, Harvard, Vancouver, ISO itp.
9

Drummond, C. "Accelerating Reinforcement Learning by Composing Solutions of Automatically Identified Subtasks." Journal of Artificial Intelligence Research 16 (February 1, 2002): 59–104. http://dx.doi.org/10.1613/jair.904.

Pełny tekst źródła
Streszczenie:
This paper discusses a system that accelerates reinforcement learning by using transfer from related tasks. Without such transfer, even if two tasks are very similar at some abstract level, an extensive re-learning effort is required. The system achieves much of its power by transferring parts of previously learned solutions rather than a single complete solution. The system exploits strong features in the multi-dimensional function produced by reinforcement learning in solving a particular task. These features are stable and easy to recognize early in the learning process. They generate a par
Style APA, Harvard, Vancouver, ISO itp.
10

Li, Zhi Yong, and Yun Ping Ai. "Study on the Multi-Core DSP Parallel Processing of Polarization Images Registration." Advanced Materials Research 756-759 (September 2013): 3532–36. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.3532.

Pełny tekst źródła
Streszczenie:
Three-channel polarization images must be registered before pixel-level fusion processing to acquire accurate polarization characteristics information. In the condition of serial processing, the image registration efficiency is bad, and then the real-time of polarization imaging application is poor. The multi-core DSP chip which type is TMS320C6670 is selected as the polarization images processing platform. Fourier-Mellin Transform (FMT) is selected as the registration algorithm. The parallel processing of the polarization image registration is studied based on data flow model. The hierarchica
Style APA, Harvard, Vancouver, ISO itp.

Rozprawy doktorskie na temat "Multi-level graph partitioning"

1

Agarwal, Prateek. "Multi-level Partitioning Algorithms & Reliability Analysis for Transit Networks." Thesis, 2021. https://etd.iisc.ac.in/handle/2005/5806.

Pełny tekst źródła
Streszczenie:
Public transit systems are an indispensable part of any metropolitan city. Its success depends on many factors, chief among which is the ease with which users can query for optimal journeys using mobile apps. Conventional approaches model the transit network as a time-expanded or time-dependent graph and run a variant of the Dijkstra's algorithm. However, this method turns out to be too slow for large networks. Furthermore, while planning a journey using public transit, besides travel time, the number of transfers is equally important. To address these problems, several multi-criteria journey
Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Multi-level graph partitioning"

1

Al-Shaikhli, Saif Dawood Salman, Michael Ying Yang, and Bodo Rosenhahn. "Medical Image Segmentation Using Multi-level Set Partitioning with Topological Graph Prior." In Image and Video Technology – PSIVT 2013 Workshops. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-53926-8_15.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Bunyak, Filiz, and Kannappan Palaniappan. "Level Set-Based Fast Multi-phase Graph Partitioning Active Contours Using Constant Memory." In Advanced Concepts for Intelligent Vision Systems. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04697-1_14.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Toulouse, Michel, Krishnaiyan Thulasiraman, and Fred Glover. "Multi-level Cooperative Search: A New Paradigm for Combinatorial Optimization and an Application to Graph Partitioning." In Euro-Par’99 Parallel Processing. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48311-x_75.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Chevalier, Cédric, and François Pellegrini. "Improvement of the Efficiency of Genetic Algorithms for Scalable Parallel Graph Partitioning in a Multi-level Framework." In Euro-Par 2006 Parallel Processing. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11823285_25.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

"Topology-Aware Load-Balance Schemes for Heterogeneous Graph Processing." In Advances in Computer and Electrical Engineering. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-3799-1.ch005.

Pełny tekst źródła
Streszczenie:
Inspired by the insights presented in Chapters 2, 3, and 4, in this chapter the authors present the KCMAX (K-Core MAX) and the KCML (K-Core Multi-Level) frameworks: novel k-core-based graph partitioning approaches that produce unbalanced partitions of complex networks that are suitable for heterogeneous parallel processing. Then they use KCMAX and KCML to explore the configuration space for accelerating BFSs on large complex networks in the context of TOTEM, a BSP heterogeneous GPU + CPU HPC platform. They study the feasibility of the heterogeneous computing approach by systematically studying different graph partitioning strategies, including the KCMAX and KCML algorithms, while processing synthetic and real-world complex networks.
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Multi-level graph partitioning"

1

Moreira, Orlando, Merten Popp, and Christian Schulz. "Evolutionary multi-level acyclic graph partitioning." In GECCO '18: Genetic and Evolutionary Computation Conference. ACM, 2018. http://dx.doi.org/10.1145/3205455.3205464.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Pope, Aaron S., Daniel R. Tauritz, and Alexander D. Kent. "Evolving Multi-level Graph Partitioning Algorithms." In 2016 IEEE Symposium Series on Computational Intelligence (SSCI). IEEE, 2016. http://dx.doi.org/10.1109/ssci.2016.7849930.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Lee, Y. M., J. S. Wu, T. F. Jiang, and Y. S. Chen. "Direct Numerical Simulation of the Interaction of an Ultra Short-Pulsed Intense Laser With a H2+ Molecule." In ASME 2008 First International Conference on Micro/Nanoscale Heat Transfer. ASMEDC, 2008. http://dx.doi.org/10.1115/mnht2008-52350.

Pełny tekst źródła
Streszczenie:
In this paper, interactions of a linearly polarized ultra short-pulsed intense laser with a single H2+ molecule at various angles of incidence are studied by directly solving the time-dependent three-dimensional Schrodinger equation (TDSE), assuming Born-Oppenheimer approximation. An explicit stagger-time algorithm is employed for time integration of the TDSE, in which the real and imaginary parts of the wave function are defined at alternative times, while a cell-centered finite-volume method is utilized for spatial discretization of the TDSE on Cartesian grids. The TDSE solver is then parall
Style APA, Harvard, Vancouver, ISO itp.
4

Koeln, Justin P., Matthew A. Williams, and Andrew G. Alleyne. "Hierarchical Control of Multi-Domain Power Flow in Mobile Systems: Part I — Framework Development and Demonstration." In ASME 2015 Dynamic Systems and Control Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/dscc2015-9908.

Pełny tekst źródła
Streszczenie:
This two-part paper presents the development of a hierarchical control framework for the control of power flow throughout mobile systems. These vehicles are comprised of multiple interconnected systems each with multiple subsystems which exhibit dynamics over a wide range of timescales. These interconnections and the timescale separation pose a significant challenge when developing an effective control strategy. Part I presents the proposed graph-based modeling approach and the three-level hierarchical control framework developed to directly address these interconnections and timescale separat
Style APA, Harvard, Vancouver, ISO itp.
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii