A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Local search breaks 1.75 for Graph Balancing
[article]
2018
arXiv
pre-print
Preserved Fulltext
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. ...
arXiv:1811.00955v1
fatcat:alvrverlrvdpxdpos6px4opqdy
Local Search Breaks 1.75 for Graph Balancing
2019
International Colloquium on Automata, Languages and Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
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. ...
doi:10.4230/lipics.icalp.2019.74
dblp:conf/icalp/JansenR19
fatcat:g4brhlwmi5f7dlk4w3bepfipgq
Spatial and Temporal Splitting Heuristics for Multi-Robot Motion Planning
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
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] . ...
arXiv:2103.14111v1
fatcat:6ycn4mvpobhxxggsmxcaupc4ke
Engineering Multilevel Graph Partitioning Algorithms
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
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. ...
arXiv:1012.0006v3
fatcat:7a4cq7jjhvbfnc6bifuqjpfeea
Scaling graph traversal to 281 trillion edges with 40 million cores
2022
Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
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. ...
doi:10.1145/3503221.3508403
fatcat:qutnrxs4cfdsxbwsvh4tymwlqy
Modeling acquaintance networks based on balance theory
2014
International Journal of Applied Mathematics and Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
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. ...
doi:10.2478/amcs-2014-0050
fatcat:5yi77op4ubgqdkla6yijqaom2q
Analysis of Exchange Rate-Foreign Trade Relationship with Asymmetric Causality Tests: Sample of Gaziantep
2017
International Journal of Academic Research in Business and Social Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
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. ...
doi:10.6007/ijarbss/v7-i10/3368
fatcat:74sq3pggmnc63bsmuo3vzp3x24
A reactive GRASP for a commercial territory design problem with multiple balancing requirements
2009
Computers & Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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 ...
doi:10.1016/j.cor.2007.10.024
fatcat:bkp5ro7cvbe2rj6u6dizoig7ly
Partitioning Trillion-Edge Graphs in Minutes
2017
2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
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. ...
doi:10.1109/ipdps.2017.95
dblp:conf/ipps/SlotaRDM17
fatcat:osvwtvqz35dkdh6dhvhcemih4i
Scalable Breadth-First Search on a GPU Cluster
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
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. ...
arXiv:1803.03922v2
fatcat:kkoc3bwdfvhaxdjmwpk7oabmzq
BreakingBED – Breaking Binary and Efficient Deep Neural Networks by Adversarial Attacks
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
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. ...
arXiv:2103.08031v1
fatcat:b3yvnuenofe3rnq5ufasmokk3e
Distributed Edge Partitioning for Trillion-edge Graphs
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
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. ...
arXiv:1908.05855v2
fatcat:5atwo3vjfbhozksdhiw5c25j24
Towards efficient resource provisioning in MapReduce
2016
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
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. ...
doi:10.1016/j.jpdc.2016.04.001
fatcat:nr2ubgp2p5dm3fyfrv7cbux2r4
Scalable SIMD-Efficient Graph Processing on GPUs
2015
2015 International Conference on Parallel Architecture and Compilation (PACT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
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. ...
doi:10.1109/pact.2015.15
dblp:conf/IEEEpact/KhorasaniGB15
fatcat:b7keht62qjewbhw4qs5g3cuxga
An Adaptive Hybrid Ant Colony Optimization Algorithm for The Classification Problem
2019
Information Technology and Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
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. ...
doi:10.5755/j01.itc.48.4.22330
fatcat:vnwif6utv5a65c3rt6pfywfjry
« Previous
Showing results 1 — 15 out of 4,631 results