Relevant bibliographies by topics / Balanced partitioning

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Balanced partitioning'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Balanced partitioning.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Balanced partitioning"

1

Hannah Honghua Yang and D. F. Wong. "Balanced partitioning." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15, no. 12 (1996): 1533–40. http://dx.doi.org/10.1109/43.552086.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Andreev, Konstantin, and Harald Racke. "Balanced Graph Partitioning." Theory of Computing Systems 39, no. 6 (2006): 929–39. http://dx.doi.org/10.1007/s00224-006-1350-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Avin, Chen, Marcin Bienkowski, Andreas Loukas, Maciej Pacut, and Stefan Schmid. "Dynamic Balanced Graph Partitioning." SIAM Journal on Discrete Mathematics 34, no. 3 (2020): 1791–812. http://dx.doi.org/10.1137/17m1158513.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Robertson, Blair, Trent McDonald, Chris Price, and Jennifer Brown. "Halton iterative partitioning: spatially balanced sampling via partitioning." Environmental and Ecological Statistics 25, no. 3 (2018): 305–23. http://dx.doi.org/10.1007/s10651-018-0406-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Dahlhaus, Elias, Jan Kratochvíl, Paul D. Manuel, and Mirka Miller. "Transversal partitioning in balanced hypergraphs." Discrete Applied Mathematics 79, no. 1-3 (1997): 75–89. http://dx.doi.org/10.1016/s0166-218x(97)00034-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Soltan, Saleh, Mihalis Yannakakis, and Gil Zussman. "Doubly Balanced Connected Graph Partitioning." ACM Transactions on Algorithms 16, no. 2 (2020): 1–24. http://dx.doi.org/10.1145/3381419.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

El Moussawi, Adnan, Nacera Bennacer Seghouani, and Francesca Bugiotti. "BGRAP: Balanced GRAph Partitioning Algorithm for Large Graphs." Journal of Data Intelligence 2, no. 2 (2021): 116–35. http://dx.doi.org/10.26421/jdi2.2-2.

Full text
Abstract:
The definition of effective strategies for graph partitioning is a major challenge in distributed environments since an effective graph partitioning allows to considerably improve the performance of large graph data analytics computations. In this paper, we propose a multi-objective and scalable Balanced GRAph Partitioning (\algo) algorithm, based on Label Propagation (LP) approach, to produce balanced graph partitions. \algo defines a new efficient initialization procedure and different objective functions to deal with either vertex or edge balance constraints while considering edge direction
APA, Harvard, Vancouver, ISO, and other styles
8

Aydin, Kevin, MohammadHossein Bateni, and Vahab Mirrokni. "Distributed Balanced Partitioning via Linear Embedding †." Algorithms 12, no. 8 (2019): 162. http://dx.doi.org/10.3390/a12080162.

Full text
Abstract:
Balanced partitioning is often a crucial first step in solving large-scale graph optimization problems, for example, in some cases, a big graph can be chopped into pieces that fit on one machine to be processed independently before stitching the results together, leading to certain suboptimality from the interaction among different pieces. In other cases, links between different parts may show up in the running time and/or network communications cost, hence the desire to have small cut size. We study a distributed balanced-partitioning problem where the goal is to partition the vertices of a g
APA, Harvard, Vancouver, ISO, and other styles
9

Borgwardt, Steffen, and Shmuel Onn. "Efficient solutions for weight-balanced partitioning problems." Discrete Optimization 21 (August 2016): 71–84. http://dx.doi.org/10.1016/j.disopt.2016.06.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Conforti, Michele, Marco Di Summa, and Giacomo Zambelli. "Minimally Infeasible Set-Partitioning Problems with Balanced Constraints." Mathematics of Operations Research 32, no. 3 (2007): 497–507. http://dx.doi.org/10.1287/moor.1070.0250.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Balanced partitioning"

1

Elander, Aman Johan. "Distributed balanced edge-cut partitioning of large graphs having weighted vertices." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-175145.

Full text
Abstract:
Large scale graphs are sometimes too big to store and process on a single machine. Instead, these graphs have to be divided into smaller parts and distributed over several machines, while minimizing the dependency between the different parts. This is known as the graph partitioning problem, which has been shown to be NP-complete. The problem is well studied, however most solutions are either not suitable for a distributed environment or unable to do balanced partitioning of graphs having weighted vertices. This thesis presents an extension to the distributed balanced graph partitioning algorit
APA, Harvard, Vancouver, ISO, and other styles
2

Alkhelaiwi, Ali Mani Turki. "Network partitioning techniques based on network natural properties for power system application." Thesis, Brunel University, 2002. http://bura.brunel.ac.uk/handle/2438/5065.

Full text
Abstract:
In this thesis, the problem of partitioning a network into interconnected sub-networks is addressed. The goal is to achieve a partitioning which satisfies a set of specific engineering constraints, imposed in this case, by the requirements of the decomposed state-estimation (DSE) in electrical power systems. The network-partitioning problem is classified as NP-hard problem. Although many heuristic algorithms have been proposed for its solution, these often lack directness and computational simplicity. In this thesis, three new partitioning techniques are described which (i) satisfy the DSE con
APA, Harvard, Vancouver, ISO, and other styles
3

McHenry, Bailey Marie. "Balanced nutrition and crop production practices for the study of grain sorghum nutrient partitioning and closing yield gaps." Thesis, Kansas State University, 2016. http://hdl.handle.net/2097/32725.

Full text
Abstract:
Master of Science<br>Agronomy<br>Ignacio Ciampitti<br>P. V. Vara Prasad<br>Mid-west grain sorghum (Sorghum bicolor (L.) Moench) producers are currently obtaining much lower than attainable yields across varying environments, therefore, closing yield gaps will be important. Yield gaps are the difference between maximum economic attainable yield and current on-farm yields. Maximum economic yield can be achieved through the optimization of utilizing the best genotypes and management practices for the specific site-environment (soil-weather) combination. This research project examines several mana
APA, Harvard, Vancouver, ISO, and other styles
4

Echbarthi, Ghizlane. "Big Graph Processing : Partitioning and Aggregated Querying." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSE1225/document.

Full text
Abstract:
Avec l'avènement du « big data », de nombreuses répercussions ont eu lieu dans tous les domaines de la technologie de l'information, préconisant des solutions innovantes remportant le meilleur compromis entre coûts et précision. En théorie des graphes, où les graphes constituent un support de modélisation puissant qui permet de formaliser des problèmes allant des plus simples aux plus complexes, la recherche pour des problèmes NP-complet ou NP-difficils se tourne plutôt vers des solutions approchées, mettant ainsi en avant les algorithmes d'approximations et les heuristiques alors que les solu
APA, Harvard, Vancouver, ISO, and other styles
5

Nottingham, Andrew Thomas. "The carbon balance of tropical forest soils : partitioning sources of respiration." Thesis, University of Cambridge, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.608423.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Villalobos, Jorge Alejandro. "DEVELOPMENT AND IMPLEMENTATION OF THE MULTI-RESOLUTION AND LOADING OF TRANSPORTATION ACTIVITIES (MALTA) SIMULATION BASED DYNAMIC TRAFFIC ASSIGNMENT SYSTEM, RECURSIVE ON-LINE LOAD BALANCE FRAMEWORK (ROLB)." Diss., The University of Arizona, 2011. http://hdl.handle.net/10150/203446.

Full text
Abstract:
The Multi-resolution Assignment and Loading of Transport Activities (MALTA) system is a simulation-based Dynamic Traffic Assignment model that exploits the advantages of multi-processor computing via the use of the Message Passing Interface (MPI) protocol. Spatially partitioned transportation networks are utilized to estimate travel time via alternate routes on mega-scale network models, while the concurrently run shortest path and assignment procedures evaluate traffic conditions and re-assign traffic in order to achieve traffic assignment goals such as User Optimal and/or System Optimal con
APA, Harvard, Vancouver, ISO, and other styles
7

Britton, Kevin John. "Application of a Mass Balance Partitioning Model of Ra-226, Pb-210 and Po-210 to Freshwater Lakes and Streams." Thesis, Université d'Ottawa / University of Ottawa, 2018. http://hdl.handle.net/10393/38459.

Full text
Abstract:
The objectives of this thesis were: (1) to develop a mass balance partitioning model of the natural uranium-238 series comprising radium-226, lead-210 and polonium-210 and (2) to apply the model to estimate the source and fate of these radionuclides in freshwater lakes and streams. Samples were collected from Ottawa River watershed tributaries and measured for lead-210 and polonium-210 content to determine the water concentrations that were input to the model. The radium-226 partitioning model was developed by reconstructing and analyzing Quantitative Water, Air, Sediment Interaction (QWASI)
APA, Harvard, Vancouver, ISO, and other styles
8

DeVita-McBride, Amy Kathleen. "Analysis of the Acid-Base Balance of Mainstream Tobacco Smoke and its Effect on the Gas/Particle Partitioning of Nicotine." PDXScholar, 2017. https://pdxscholar.library.pdx.edu/open_access_etds/4156.

Full text
Abstract:
Tobacco smoke particulate matter (PM) is a complex mixture of condensed organic compounds, with about 5 to 10% water. Its general properties are similar in some respects to that of atmospheric organic aerosol PM and thus provides a useful surrogate when studying atmospheric PM. Due to its ability to undergo acid-base chemistry, nicotine is of particular interest in the tobacco smoke system. The gas/particle partitioning of nicotine depends on the protonation state of nicotine in the particles, so the distribution of nicotine between these phases provides a means of understanding the acid-base
APA, Harvard, Vancouver, ISO, and other styles
9

Fisher, Russ James. "Partitioning of nitrogen by lactating cows fed diets varying in nonfibrous carbohydrate and rumen undegradable protein." Diss., This resource online, 1995. http://scholar.lib.vt.edu/theses/available/etd-10042006-143902/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dubbert, Maren [Verfasser], and Christiane [Akademischer Betreuer] Werner. "Water balance and productivity of a Mediterranean oak woodland: Quantifying understory vegetation impacts by development of a stable oxygen isotope partitioning approach / Maren Dubbert. Betreuer: Christiane Werner." Bayreuth : Universität Bayreuth, 2014. http://d-nb.info/1060010348/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Balanced partitioning"

1

Venugopal, Sesh. Effects of partitioning and scheduling sparse matrix factorization on communication and load balance. National Aeronautics and Space Administration, Langley Research Center, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Balanced partitioning"

1

Amir, Amihood, Jessica Ficler, Robert Krauthgamer, Liam Roditty, and Oren Sar Shalom. "Multiply Balanced k −Partitioning." In LATIN 2014: Theoretical Informatics. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54423-1_51.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Naor, Joseph. "From Balanced Graph Partitioning to Balanced Metric Labeling." In Algorithms – ESA 2005. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11561071_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Carlini, Emanuele, Patrizio Dazzi, Andrea Esposito, Alessandro Lulli, and Laura Ricci. "Balanced Graph Partitioning with Apache Spark." In Lecture Notes in Computer Science. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-14325-5_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Smorodkina, Ekaterina, Mayur Thakur, and Daniel Tauritz. "Algorithms for the Balanced Edge Partitioning Problem." In Experimental Algorithms. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-72845-0_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yang, Wenyin, Guojun Wang, Li Ma, and Shiyang Wu. "A Distributed Algorithm for Balanced Hypergraph Partitioning." In Lecture Notes in Computer Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-49178-3_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sanders, Peter, and Christian Schulz. "Think Locally, Act Globally: Highly Balanced Graph Partitioning." In Experimental Algorithms. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38527-8_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yang, Honghua Hannah, and D. F. Wong. "Efficient Network Flow Based Min-Cut Balanced Partitioning." In The Best of ICCAD. Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-0292-0_41.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yang, Honghua Hannah, and Martin D. F. Wong. "Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach." In Encyclopedia of Algorithms. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_68.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Feldmann, Andreas Emil. "Fast Balanced Partitioning Is Hard Even on Grids and Trees." In Mathematical Foundations of Computer Science 2012. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32589-2_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wong, Martin D. F., and Honghua Hannah Yang. "Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_68.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Balanced partitioning"

1

Andreev, Konstantin, and Harald Räcke. "Balanced graph partitioning." In the sixteenth annual ACM symposium. ACM Press, 2004. http://dx.doi.org/10.1145/1007912.1007931.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Krauthgamer, Robert, Joseph (Seffi) Naor, and Roy Schwartz. "Partitioning Graphs into Balanced Components." In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2009. http://dx.doi.org/10.1137/1.9781611973068.102.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Soltan, Saleh, Mihalis Yannakakis, and Gil Zussman. "Doubly Balanced Connected Graph Partitioning." In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2017. http://dx.doi.org/10.1137/1.9781611974782.126.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pacut, Maciej, Mahmoud Parham, and Stefan Schmid. "Optimal Online Balanced Graph Partitioning." In IEEE INFOCOM 2021 - IEEE Conference on Computer Communications. IEEE, 2021. http://dx.doi.org/10.1109/infocom42981.2021.9488824.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wu, Jigang, Guiyuan Jiang, Lili Zheng, and Suiping Zhou. "Algorithms for Balanced Graph Bi-partitioning." In 2014 IEEE International Conference on High Performance Computing and Communications (HPCC), 2014 IEEE 6th International Symposium on Cyberspace Safety and Security (CSS) and 2014 IEEE 11th International Conference on Embedded Software and Systems (ICESS). IEEE, 2014. http://dx.doi.org/10.1109/hpcc.2014.35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wu, Xindong, Shaojing Sheng, and Peng Zhou. "Balanced Tree Partitioning with Succinct Logic." In 2020 IEEE International Conference on Knowledge Graph (ICKG). IEEE, 2020. http://dx.doi.org/10.1109/icbk50248.2020.00083.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Aydin, Kevin, MohammadHossein Bateni, and Vahab Mirrokni. "Distributed Balanced Partitioning via Linear Embedding." In WSDM 2016: Ninth ACM International Conference on Web Search and Data Mining. ACM, 2016. http://dx.doi.org/10.1145/2835776.2835829.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ugander, Johan, and Lars Backstrom. "Balanced label propagation for partitioning massive graphs." In the sixth ACM international conference. ACM Press, 2013. http://dx.doi.org/10.1145/2433396.2433461.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hardhik, Mallipeddi, Dip Sankar Banerjee, Kiran Raj Ramamoorthy, Kishore Kothapalli, and Kannan Srinathan. "Nearly Balanced Work Partitioning for Heterogeneous Algorithms." In 2017 46th International Conference on Parallel Processing (ICPP). IEEE, 2017. http://dx.doi.org/10.1109/icpp.2017.14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Awadelkarim, Amel, and Johan Ugander. "Prioritized Restreaming Algorithms for Balanced Graph Partitioning." In KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. ACM, 2020. http://dx.doi.org/10.1145/3394486.3403239.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Balanced partitioning"

1

DeVita-McBride, Amy. Analysis of the Acid-Base Balance of Mainstream Tobacco Smoke and its Effect on the Gas/Particle Partitioning of Nicotine. Portland State University Library, 2000. http://dx.doi.org/10.15760/etd.6044.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Balanced partitioning' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography