Filters








4,631 Hits in 4.3 sec

Local search breaks 1.75 for Graph Balancing [article]

Klaus Jansen, Lars Rohwedder
<span title="2018-11-02">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
With a number of technical novelties we are able to obtain a bound of 1.749 for the case of Graph Balancing.  ...  Graph Balancing was the last one in a group of related problems from literature, for which it was open whether the configuration LP is stronger than previous, simple LP relaxations.  ...  This gives a tiny margin to improve the bound of 1.75. It is also a sensible approach for improving our bound of 11/6 for Restricted Assignment.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1811.00955v1">arXiv:1811.00955v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/alvrverlrvdpxdpos6px4opqdy">fatcat:alvrverlrvdpxdpos6px4opqdy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191027041448/https://arxiv.org/pdf/1811.00955v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0e/04/0e049e37a2e707704f039ccdc690b0085400741a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1811.00955v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Local Search Breaks 1.75 for Graph Balancing

Klaus Jansen, Lars Rohwedder, Michael Wagner
<span title="2019-07-08">2019</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pf6v2q6ji5h7birkbrtpdc2uhy" style="color: black;">International Colloquium on Automata, Languages and Programming</a> </i> &nbsp;
With a number of technical novelties we are able to obtain a bound of 1.749 for the case of Graph Balancing.  ...  Graph Balancing was the last one in a group of related problems from literature, for which it was open whether the configuration LP is stronger than previous, simple LP relaxations.  ...  Fact 2. 0 1 9 74:10 Local Search Breaks 1.75 for Graph Balancing ). By this induction we have that edges repelled w.r.t.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.icalp.2019.74">doi:10.4230/lipics.icalp.2019.74</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icalp/JansenR19.html">dblp:conf/icalp/JansenR19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/g4brhlwmi5f7dlk4w3bepfipgq">fatcat:g4brhlwmi5f7dlk4w3bepfipgq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220307212206/https://drops.dagstuhl.de/opus/volltexte/2019/10650/pdf/LIPIcs-ICALP-2019-74.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d4/07/d40776d333383af215458369f1f8b631c883a593.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.icalp.2019.74"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Spatial and Temporal Splitting Heuristics for Multi-Robot Motion Planning [article]

Teng Guo and Shuai D. Han and Jingjin Yu
<span title="2021-03-25">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this work, we systematically examine the application of spatio-temporal splitting heuristics to the Multi-Robot Motion Planning (MRMP) problem in a graph-theoretic setting: a problem known to be NP-hard  ...  Notably, spatial partition of problem fusing with the temporal splitting heuristic and the enhanced conflict based search (ECBS) algorithm increases the scalability of ECBS on large and challenging DAO  ...  One of the earliest work is Local Repair A * (LRA * ) [23] , which employs a basic form of decoupled search assisted with local repairs. The decoupling idea was also explored in [12] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2103.14111v1">arXiv:2103.14111v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6ycn4mvpobhxxggsmxcaupc4ke">fatcat:6ycn4mvpobhxxggsmxcaupc4ke</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210330051606/https://arxiv.org/pdf/2103.14111v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ec/0a/ec0ae29b517bb695f0c533c012615c76aa876f46.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2103.14111v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Engineering Multilevel Graph Partitioning Algorithms [article]

Peter Sanders, Christian Schulz
<span title="2011-04-04">2011</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We present a multi-level graph partitioning algorithm using novel local improvement algorithms and global search strategies transferred from the multi-grid community.  ...  Local improvement algorithms are based max-flow min-cut computations and more localized FM searches.  ...  We also thank Tanja Hartmann, Robert Görke and Bastian Katz for valuable advice regarding balanced min cuts.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1012.0006v3">arXiv:1012.0006v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7a4cq7jjhvbfnc6bifuqjpfeea">fatcat:7a4cq7jjhvbfnc6bifuqjpfeea</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1012.0006/1012.0006.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1012.0006v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Scaling graph traversal to 281 trillion edges with 40 million cores

Huanqi Cao, Yuanwei Wang, Haojie Wang, Heng Lin, Zixuan Ma, Wanwang Yin, Wenguang Chen
<span title="2022-03-28">2022</span> <i title="ACM"> Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming </i> &nbsp;
However, the graph with an unprecedented scale also brings severe performance challenges, including load imbalance, poor locality, and irregular access of graph traversal workload.  ...  By delegating extremely heavy vertices globally and other heavy vertices on columns and rows in the processes mesh, we break the scalability wall of previous partitioning methods.  ...  It includes two typical graph applications, breadthfirst search (BFS) and single-source shortest path (SSSP), as problems for the benchmark.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3503221.3508403">doi:10.1145/3503221.3508403</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qutnrxs4cfdsxbwsvh4tymwlqy">fatcat:qutnrxs4cfdsxbwsvh4tymwlqy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220402161939/https://dl.acm.org/doi/pdf/10.1145/3503221.3508403" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7f/1d/7f1d728c49a3ebf1c67f4e99ec317407bfa20055.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3503221.3508403"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Modeling acquaintance networks based on balance theory

Vida Vukašinović, Jurij Šilc, Risth Škrekovski
<span title="2014-09-01">2014</span> <i title="Walter de Gruyter GmbH"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/gtmb6i7f4nafrasuvcrl3t5ahe" style="color: black;">International Journal of Applied Mathematics and Computer Science</a> </i> &nbsp;
The number of edges slowly increases with the number of repeated weighted local searches for new acquaintances M L , see Fig. 3(a) .  ...  The people in the imbalanced triads tend to make them balanced or some connections may break.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2478/amcs-2014-0050">doi:10.2478/amcs-2014-0050</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5yi77op4ubgqdkla6yijqaom2q">fatcat:5yi77op4ubgqdkla6yijqaom2q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190224155101/http://pdfs.semanticscholar.org/6466/d4d16cbda9e5ba9e7253c66908313629f028.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/64/66/6466d4d16cbda9e5ba9e7253c66908313629f028.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2478/amcs-2014-0050"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Analysis of Exchange Rate-Foreign Trade Relationship with Asymmetric Causality Tests: Sample of Gaziantep

Ibrahim CUTCU, Mehmet Vahit EREN
<span title="2017-10-26">2017</span> <i title="Human Resources Management Academic Research Society (HRMARS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pjziqoljcve5jmsf2lfsq6j36q" style="color: black;">International Journal of Academic Research in Business and Social Sciences</a> </i> &nbsp;
According to Hatemi-J co-integration and asymmetric causality test findings, it is accepted that there is causality and long termed relationship with structural break between exchange rate and importation  ...  Model A searches for the existence of two structural breaks in averages of series while Model C searches for the existence of two structural breaks in average and trends of series.  ...  Lee and Strazicich (2003) have developed unit root test which searches for two structural breaks in series.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.6007/ijarbss/v7-i10/3368">doi:10.6007/ijarbss/v7-i10/3368</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/74sq3pggmnc63bsmuo3vzp3x24">fatcat:74sq3pggmnc63bsmuo3vzp3x24</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190429113438/http://hrmars.com/hrmars_papers/Analysis_of_Exchange_Rate-Foreign_Trade_Relationship_with_Asymmetric_Causality_Tests_Sample_of_Gaziantep.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fe/6e/fe6e7a97a0b71aecb9cf29993f217f395343bcca.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.6007/ijarbss/v7-i10/3368"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

A reactive GRASP for a commercial territory design problem with multiple balancing requirements

Roger Z. Ríos-Mercado, Elena Fernández
<span title="">2009</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zfqmu5yfvjbg3f4h6f7a5j3jr4" style="color: black;">Computers &amp; Operations Research</a> </i> &nbsp;
The local search scheme proved to be very effective as well.  ...  search phase in unpromising bad solutions generated by the construction phase.  ...  Acknowledgments The research of the first author was supported by the Spanish State Secretary for Universities and Research under its Visiting Scholar Program (grant SAB2004-0092), the Mexican National  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.cor.2007.10.024">doi:10.1016/j.cor.2007.10.024</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bkp5ro7cvbe2rj6u6dizoig7ly">fatcat:bkp5ro7cvbe2rj6u6dizoig7ly</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809110329/http://gama.fime.uanl.mx/~roger/work/teaching/clase_tso/tarea6_material/reprint-cor-2009.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/64/17/64175d0ac6bb27a483bf82675e3a2ddc97fc3140.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.cor.2007.10.024"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Partitioning Trillion-Edge Graphs in Minutes

George M. Slota, Sivasankaran Rajamanickam, Karen Devine, Kamesh Madduri
<span title="">2017</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/t3x4vqewrncrfgn2wu7cafsbsq" style="color: black;">2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</a> </i> &nbsp;
heuristic, called parallel expansion, where each partition is constructed in parallel by greedily expanding its edge set from a single vertex in such a way that the increase of the vertex cuts becomes local  ...  We propose Distributed Neighbor Expansion (Distributed NE), a parallel and distributed graph partitioning method that can scale to trillion-edge graphs while providing high partitioning quality.  ...  The input graph needs to be evenly divided for workload balancing and to be stored in a space-efficient way.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdps.2017.95">doi:10.1109/ipdps.2017.95</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ipps/SlotaRDM17.html">dblp:conf/ipps/SlotaRDM17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/osvwtvqz35dkdh6dhvhcemih4i">fatcat:osvwtvqz35dkdh6dhvhcemih4i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200320065108/http://www.vldb.org/pvldb/vol12/p2379-hanai.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/62/9c/629c97be895ff41ae46a4035666f1c2467470824.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdps.2017.95"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Scalable Breadth-First Search on a GPU Cluster [article]

Yuechao Pan, Roger Pearce, John D. Owens
<span title="2018-04-05">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
On a GPU cluster, the ratio of high computing power to communication bandwidth makes scaling breadth-first search (BFS) on a scale-free graph extremely challenging.  ...  Our communication model uses global reduction for high-degree vertices, and point-to-point transmission for low-degree vertices.  ...  Please contact rpearce@llnl.gov for the latest updates.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1803.03922v2">arXiv:1803.03922v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kkoc3bwdfvhaxdjmwpk7oabmzq">fatcat:kkoc3bwdfvhaxdjmwpk7oabmzq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200902061051/https://arxiv.org/pdf/1803.03922v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e6/40/e6405237a5ea75014100328a7ab67c26645314cf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1803.03922v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

BreakingBED – Breaking Binary and Efficient Deep Neural Networks by Adversarial Attacks [article]

Manoj Rohit Vemparala, Alexander Frickenstein, Nael Fasfous, Lukas Frickenstein, Qi Zhao, Sabine Kuhn, Daniel Ehrhardt, Yuankai Wu, Christian Unger, Naveen Shankar Nagaraja, Walter Stechele
<span title="2021-03-14">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Deploying convolutional neural networks (CNNs) for embedded applications presents many challenges in balancing resource-efficiency and task-related accuracy.  ...  We present evaluation methods to simplify the comparison between CNNs under different attack schemes using loss/accuracy levels, stress-strain graphs, box-plots and class activation mapping (CAM).  ...  Lastly, a network which breaks before it deforms can be considered a brittle network. Fig. 3 shows a set of stress-strain graphs for all the networks and attacks investigated.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2103.08031v1">arXiv:2103.08031v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/b3yvnuenofe3rnq5ufasmokk3e">fatcat:b3yvnuenofe3rnq5ufasmokk3e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210319112544/https://arxiv.org/pdf/2103.08031v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d8/45/d845effa53a3a6addc9c6a705013cee1f62b49a4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2103.08031v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Distributed Edge Partitioning for Trillion-edge Graphs [article]

Masatoshi Hanai, Toyotaro Suzumura, Wen Jun Tan, Elvis Liu, Georgios Theodoropoulos, Wentong Cai
<span title="2019-09-21">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
heuristic, called parallel expansion, where each partition is constructed in parallel by greedily expanding its edge set from a single vertex in such a way that the increase of the vertex cuts becomes local  ...  We propose Distributed Neighbor Expansion (Distributed NE), a parallel and distributed graph partitioning method that can scale to trillion-edge graphs while providing high partitioning quality.  ...  The input graph needs to be evenly divided for workload balancing and to be stored in a space-efficient way.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1908.05855v2">arXiv:1908.05855v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5atwo3vjfbhozksdhiw5c25j24">fatcat:5atwo3vjfbhozksdhiw5c25j24</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200928112646/https://arxiv.org/pdf/1908.05855v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/30/da/30da9988d148e08f0fc1124c5671c103dd1a8ba3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1908.05855v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Towards efficient resource provisioning in MapReduce

Peter P. Nghiem, Silvia M. Figueira
<span title="">2016</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rwjg7tprafhufajayuvxj2q4n4" style="color: black;">Journal of Parallel and Distributed Computing</a> </i> &nbsp;
for any workload running on Hadoop MapReduce.  ...  the target cluster for subsequent behavioral replication.  ...  containers per node) = 1.75 * (24 * 3.6) = 151 for better load balancing.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jpdc.2016.04.001">doi:10.1016/j.jpdc.2016.04.001</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nr2ubgp2p5dm3fyfrv7cbux2r4">fatcat:nr2ubgp2p5dm3fyfrv7cbux2r4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190428151855/https://scholarcommons.scu.edu/cgi/viewcontent.cgi?article=1002&amp;context=cseng" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/74/d8/74d87d75d6972c50d4d40b0664f58218aca8f39a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jpdc.2016.04.001"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Scalable SIMD-Efficient Graph Processing on GPUs

Farzad Khorasani, Rajiv Gupta, Laxmi N. Bhuyan
<span title="">2015</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/i2tihayjsjhmhmrqaqe2apcipy" style="color: black;">2015 International Conference on Parallel Architecture and Compilation (PACT)</a> </i> &nbsp;
The vast computing power of GPUs makes them an attractive platform for accelerating large scale data parallel computations such as popular graph processing applications.  ...  Second, we further scale graph processing to make use of multiple GPUs while proposing Vertex Refinement to address the challenge of judiciously using the limited bandwidth available for transferring data  ...  Warp lanes perform a binary search over NbrIndices elements for their assigned edge index.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/pact.2015.15">doi:10.1109/pact.2015.15</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/IEEEpact/KhorasaniGB15.html">dblp:conf/IEEEpact/KhorasaniGB15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/b7keht62qjewbhw4qs5g3cuxga">fatcat:b7keht62qjewbhw4qs5g3cuxga</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160805222848/http://grasp.cs.ucr.edu:80/Papers/wsvr.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5a/e0/5ae03cf3deb5a5af67555c86be9853f308f65d4a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/pact.2015.15"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

An Adaptive Hybrid Ant Colony Optimization Algorithm for The Classification Problem

Anxiang Ma, Xiaohong Zhang, Changsheng Zhang, Bin Zhang
<span title="2019-12-18">2019</span> <i title="Kaunas University of Technology (KTU)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7og4indwyvastaeh3sjmrjhj34" style="color: black;">Information Technology and Control</a> </i> &nbsp;
The ant colony global optimization process is used to adaptively select the appropriate rule evaluation function for the data set given.  ...  Based on the classification rules obtained, the artificial bee colony optimization strategy is used to tackle the continuous attributes for further optimization of classification rules.  ...  Acknowledgments This work was supported by the Fundamental Research Funds for the Central Universities (N171604009). This work was funded by the Chinese State Foundation for Overseas Study.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5755/j01.itc.48.4.22330">doi:10.5755/j01.itc.48.4.22330</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vnwif6utv5a65c3rt6pfywfjry">fatcat:vnwif6utv5a65c3rt6pfywfjry</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200219031100/http://itc.ktu.lt:80/index.php/ITC/article/download/22330/12921" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/df/d4/dfd451883788773e8b2d3fef687765aa7fe87d22.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5755/j01.itc.48.4.22330"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 4,631 results