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.
Filters
Parallelizing Combinatorial Optimization Heuristics with GPUs
2018
Advances in Science, Technology and Engineering Systems
Preserved Fulltext
We have made a series of experiments with our proposed GPU framework to parallelize some heuristic methods such as simulated annealing, hill climbing, and genetic algorithm for solving combinatorial optimization ...
problems like Graph Bisection problem, Travelling Salesman Problem (TSP). ...
and simulated annealing algorithm with our GPU framework for Graph Bisection Problem. ...
doi:10.25046/aj030635
fatcat:566v2rey2bgyhfrjqqjvdnpihq
Particle swarm optimization for the clustering of wireless sensors
2003
Digital Wireless Communications V
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 PSO technique with a recursive bisection algorithm is tested against random search and simulated annealing; the PSO technique is shown to be robust. ...
We further investigate developing a distributed version of the PSO algorithm for clustering optimally a wireless sensor network. ...
They report using a simulated annealing approach 14 for determining optimal clustering based on a purely distance-based metric. ...
doi:10.1117/12.499080
fatcat:ro3y7ihsrvbl7l7hwj66kfn3da
A New Method, the Fusion Fission, for the Relaxed k-way Graph Partitioning Problem, and Comparisons with Some Multilevel Algorithms
2007
Journal of Mathematical Modelling and Algorithms
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 Fusion Fission method is compared to classical Multilevel packages and with a Simulated Annealing algorithm. ...
However, the Fusion Fission algorithm partitions the graph with a smaller imbalance and a smaller cut than Simulated Annealing does. keywords Graph partitioning, Multilevel, Metaheuristics, Fusion Fission ...
The authors present in this article an application of Simulated Annealing to the unweighted bisection graph partitioning problem. ...
doi:10.1007/s10852-007-9059-4
fatcat:aw7pa4n5cra43pv23tk7zi5koi
Fixed-outline floorplanning: enabling hierarchical design
2003
IEEE Transactions on Very Large Scale Integration (vlsi) Systems
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 2004; you can also visit the original URL.
The file type is application/pdf.
Our proposed moves are based on the notion of floorplan slack. ...
When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice of moves is fairly straightforward. ...
This implies multi-objective minimization. Typically, most simulated annealing based floorplanners use a linear combination of area and wirelength as an objective for the annealer. ...
doi:10.1109/tvlsi.2003.817546
fatcat:iv5qyzqjibcqhpdbehvdjibf4a
K-way Balanced Graph Partitioning for Parallel Computing
2021
Scalable Computing : Practice and Experience
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.
The algorithm works for all relevant values of k, meets or improves on earlier algorithms in terms of balanced partitioning and lowest edge-cut. ...
The goal is to partition the graph G into k partitions such that: I) the sum of weights on the nodes is approximately equal for each partition, and, II) the sum of weights on the edges across different ...
data set into clusters based on grouping of eigenvectors. [15] is effective for effectively partitioning graphs. ...
doi:10.12694/scpe.v22i4.1948
fatcat:5gashumxabh4fdtq45jczzsqce
A first step towards resilient graph partitioning for electrical grids
2014
7th International Conference on Information and Automation for Sustainability
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 2015; you can also visit the original URL.
The file type is application/pdf.
In this paper, we investigate two graph partitioning algorithms applying them to a synthesized dataset based on realistic assumptions about Yokohama, Japan. ...
We study a graph partitioning problem for electrical grids such that a given grid is partitioned into multiple ones that are self-contained concerning electricity balance. ...
They developed a clustering algorithm based on the simulation annealing method for finding optimal spatial clusters. ...
doi:10.1109/iciafs.2014.7069608
fatcat:cbcpogqe4fdjnkf4eqtad72gdm
REWIRE: An optimization-based framework for unstructured data center network design
2012
2012 Proceedings IEEE INFOCOM
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.
Therefore, we propose a data center network design framework, REWIRE, that designs networks using a local search-based algorithm. ...
DCN design is especially difficult when expanding an existing network, because traditional DCN design places strict constraints on the topology (e.g., a fat-tree). ...
Therefore, we added the ability to seed REWIRE's simulated annealing procedure with a candidate solution. To find a seed candidate, we use a heuristic based on the spectral cap of a graph. ...
doi:10.1109/infcom.2012.6195470
dblp:conf/infocom/CurtisCELK12
fatcat:sv4k2cdzlfc4tfduiuqdmvm4ma
Optimal block-tridiagonalization of matrices for coherent charge transport
2009
Journal of Computational Physics
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.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2008 pre-print arXiv:0806.2739v1 fatcat:vksbkya4lfgilgdzmow3zuq6xa
Here, we develop a matrix reordering algorithm based on graph partitioning techniques that yields the optimal block-tridiagonal form for quantum transport. ...
Numerical quantum transport calculations are commonly based on a tight-binding formulation. ...
Recursive application of the bisection algorithm 2 then leads to an algorithm for constructing a level set complying with the requirements of the graph partitioning problem 2.2, and thus an algorithm for ...
doi:10.1016/j.jcp.2009.08.001
fatcat:hxczqppjijaurdlqr3vxo2xqh4
Interleaving methods for hybrid system-level MPSoC design space exploration
2012
2012 International Conference on Embedded Computer Systems (SAMOS)
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.
Even using high-level simulations and efficient exploration algorithms, the simulation time to evaluate design points forms a real bottleneck in such DSE. ...
Simulation-based DSE, in which different design instances are evaluated using system-level simulations, typically are computationally costly. ...
RELATED WORK Current state-of-the-art in system-level DSE often deploys population-based Monte Carlo-like optimization algorithms like hill climbing, simulated annealing, ant colony optimization, or genetic ...
doi:10.1109/samos.2012.6404152
dblp:conf/samos/PiscitelliP12
fatcat:ugz3onnvirhbnp5fkkh6pv7jzu
Optimal Low-Latency Network Topologies for Cluster Performance Enhancement
[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.
The selected topologies are benchmarked using ping-pong messaging, the MPI collective communications, and the standard parallel applications including effective bandwidth, FFTE, Graph 500 and NAS parallel ...
The optimal (or sub-optimal) low-latency network topologies are found by minimizing the mean path length of regular graphs. ...
The minimum MPL graphs were constructed using our algorithm based on simulated annealing that uses a reduced search space based on girth restrictions and symmetry requirements for the graph. ...
arXiv:1904.00513v1
fatcat:eyjwnbtdnnf5zd7oubfs2kmrgq
Graph Matching Algorithm for Task Assignment Problem
2011
International Journal of Computer Science Engineering and Applications
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 2018; you can also visit the original URL.
The file type is application/pdf.
Task assignment is one of the most challenging problems in distributed computing environment. An optimal task assignment guarantees minimum turnaround time for a given architecture. ...
Using heuristic graph matching, it is often impossible to get optimal task assignment for practical test cases within an acceptable time limit. ...
search, simulated annealing and stochastic evolution as smoothers. • WGPP Multilevel graph partitioning. ...
doi:10.5121/ijcsea.2011.1609
fatcat:cld7xhzmvnhbzdh7amj2uwxnka
A Hybrid Genetic Approach for Circuit Bipartitioning
[chapter]
2004
Lecture Notes in 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 2017; you can also visit the original URL.
The file type is application/pdf.
We propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. ...
The algorithm includes a local optimization heuristic which is a modification of Fiduccia-Matheyses algorithm. ...
The ICT at Seoul National University provided research facilities for this study. ...
doi:10.1007/978-3-540-24855-2_116
fatcat:dzifl3yhjfbmzafha4cpbcq3mm
New spectral methods for ratio cut partitioning and clustering
1992
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
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.
Effective clustering methods are an immediate byproduct of the second eigenvector computation, and are very successful on the "difficult" input classes proposed in the CAD literature. ...
Finally, we discuss the very natural intersection graph representation of the circuit netlist as a basis for partitioning, and propose a heuristic based on spectral ratio cut partitioning of the netlist ...
Horst Simon of NASA Ames Research Center for providing an early version of his Lanczos implementation [23]. ...
doi:10.1109/43.159993
fatcat:jostndvucnb4phxnuwucmf2wty
A Broad Review on Various VLSI CAD Algorithms for Circuit Partitioning Problems
2018
International Journal of Mechanical and Production Engineering Research and Development
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.
algorithms, and nature-based heuristics. ...
With the main objective of minimizing the cutsize, numerous algorithms have been proposed for circuit partition which includes genetic and evolutionary algorithms, probability-based algorithms, clustering ...
A Broad Review on Various VLSI CAD Algorithms for Circuit Partitioning Problems 951 www.tjprc.org editor@tjprc.org chains Guo, Liu, Chen and Peng (2014) proposed an effective hybrid algorithm which was ...
doi:10.24247/ijmperdfeb2018115
fatcat:kbnon3xtwncjbelzmumefqpbra
COMMUNITY DETECTION IN SOCIAL NETWORKS: AN OVERVIEW
2013
International Journal of Research in Engineering and Technology
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.
We have mainly discussed various community detection algorithms in real world networks in this paper. This paper represents as an overview of the community detection algorithms in social networks. ...
This paper reflects the emergence of communities that occur in the structure of social networks, represented as graphs. ...
Simulated Annealing To get global optimization, simulated annealing [31] is probabilistic procedure used in different fields and problems. ...
doi:10.15623/ijret.2013.0214017
fatcat:7fszw4xp3zcd3fhc3nqsouwjoq
« Previous
Showing results 1 — 15 out of 540 results