Filters








52,014 Hits in 7.1 sec

Shortest These search Heading Attractions Lubukpakam Using Greedy Algorithm

IRMA YOLANDA SITORUS, PENDA SUDARTO HASUGIAN
2020 Journal of Computer Networks, Architecture and High Performance Computing  
In the case of this shortest route search actually has many different types of solutions for path searching, for example the greedy algorithm, dijkstra, floyd-warshall and bellman-ford but what is commonly  ...  used to solve this problem is the Greedy algorithm because this algorithm is an algorithm that uses a problem solving approach with look for a temporary maximum value at each step.  ...  Applications built to produce the optimal solution finding the shortest route to the location in Lubukpakam. b.  ... 
doi:10.47709/cnapc.v2i2.417 fatcat:emnwcgkpp5b3rivkq53fmx3t74

An improved optimal algorithm for bubble-sorting-based non-Manhattan channel routing

Jin-Tai Yan
1999 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
To our knowledge, for a bubble-sorting-based non-Manhattan channel routing (BSNMCR) problem, Chaudhary's O(kn 2 ) heuristic algorithm [8] and Chen's O(k 2 n) optimal algorithm [9] have been, respectively  ...  In this paper, based on optimalityoriented swap-direction selection in an optimal bubble-sorting solution, an improved optimal algorithm for a BSNMCR problem is proposed, and the time complexity of the  ...  (b) Non-Manhattan routing result by Wang's algorithm Fig. 2 .Fig. 3 . 23 Channel transformation for one-sided nets and multiple-terminal nets. Routing results for (7, 3, 2, 8, 6, 5, 4, 1).  ... 
doi:10.1109/43.743726 fatcat:tvohybd6rrespkplym2ljloyze

Coupling aware timing optimization and antenna avoidance in layer assignment

Di Wu, Jiang Hu, Rabi Mahapatra
2005 Proceedings of the 2005 international symposium on physical design - ISPD '05  
A linear time optimal jumper insertion algorithm is also derived.  ...  An improved probabilistic coupling capacitance model is suggested for coupling aware timing optimization without performing track assignment.  ...  and there is an empty track on the other side; (2) ÈÖ ¾ : probability that there are adjacent wires on two sides.  ... 
doi:10.1145/1055137.1055144 dblp:conf/ispd/WuHM05 fatcat:shscekd35zhsfhs5wxsv3gk35a

Fast Geometric Routing with Concurrent Face Traversal [chapter]

Thomas Clouser, Mark Miyashita, Mikhail Nesterenko
2008 Lecture Notes in Computer Science  
We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal.  ...  CFR maintains its advantage over the other algorithms in pure form as well as in combination with greedy routing; on planar as well as on non-planar graphs.  ...  The node memory and message-size requirements for CFR are the same as for the other geometric routing algorithms. We show that the latency of CFR is asymptotically optimal in the worst case.  ... 
doi:10.1007/978-3-540-92221-6_23 fatcat:y5xge76dszg4pow4tsns24vrs4

An Integer-Linear-Programming-Based Routing Algorithm for Flip-Chip Designs

Jia-Wei Fang, Chin-Hsiung Hsu, Yao-Wen Chang
2009 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
Our algorithm is based on integer linear programming (ILP) and guarantees to find an optimal solution for the addressed problem.  ...  In this paper, we present the first routing algorithm in the literature for the preassignment flip-chip routing problem with a predefined netlist among pads and wire-width and signal-skew considerations  ...  efficient optimal algorithm for the planar routing.  ... 
doi:10.1109/tcad.2008.2009151 fatcat:x3jmt54kzzfutoa35vybqiwxue

Network-based reconfiguration routes for a self-reconfigurable robot

JinGuo Liu, ShuGen Ma, YueChao Wang, Bin Li
2008 Science in China Series F Information Sciences  
Algorithms in graph theory have been used in enumerating the available reconfiguration routes and deciding the best reconfiguration route.  ...  And it is potentially suitable for other self-reconfigurable robots' configuration control and reconfiguration planning. self-reconfigurable robot, modular robot, reconfiguration route, network-based reconfiguration  ...  It remains a challenging problem whether we can develop optimal algorithms for the configuration network of the self-reconfigurable robot.  ... 
doi:10.1007/s11432-008-0099-9 fatcat:7j5vjnp3djayffa7ozkqyjbv3a

Path Optimization along Buoys Based on the Shortest Path Tree with Uncertain Atmospheric and Oceanographic Data

Han Xue, Tian Chai, Mario Versaci
2021 Computational Intelligence and Neuroscience  
In order to design an optimized route for ships in line with economic benefits; avoid bad weather; reduce unnecessary detours; shorten the navigation time; and achieve the purpose of safety, fuel saving  ...  The calculated ship speed travelling in route 2 is 10.523 km, and its travelling time is 1.55 h. Although the total distance of route 1 is longer, it takes less time for ships to travel in route 1.  ...  to design an optimized route for ships and avoid bad weather, so as to shorten the voyage time and achieve the purpose of safety, fuel saving, and punctual arrival at the port.  ... 
doi:10.1155/2021/6663446 pmid:33727911 pmcid:PMC7937481 fatcat:dv5r6srn6jdufaudejs6en364u

An integer linear programming based routing algorithm for flip-chip design

Jia-Wei Fang, Chin-Hsiung Hsu, Yao-Wen Chang
2007 Proceedings - Design Automation Conference  
Our algorithm is based on integer linear programming (ILP) and guarantees to find an optimal solution for the addressed problem.  ...  In this paper, we present the first routing algorithm in the literature for the pre-assignment flip-chip routing problem with a pre-defined netlist among pads and wire-width and signal-skew considerations  ...  Our ILP-based algorithm guarantees to find an optimal solution for the addressed problem.  ... 
doi:10.1145/1278480.1278633 dblp:conf/dac/FangHC07 fatcat:2kuudgjiung65dfyeh3q6xv7oi

An Integer Linear Programming Based Routing Algorithm for Flip-Chip Design

Jia-Wei Fang, Chin-Hsiung Hsu, Yao-Wen Chang
2007 Proceedings - Design Automation Conference  
Our algorithm is based on integer linear programming (ILP) and guarantees to find an optimal solution for the addressed problem.  ...  In this paper, we present the first routing algorithm in the literature for the pre-assignment flip-chip routing problem with a pre-defined netlist among pads and wire-width and signal-skew considerations  ...  Our ILP-based algorithm guarantees to find an optimal solution for the addressed problem.  ... 
doi:10.1109/dac.2007.375235 fatcat:qoy6jdpaprfkjcickyxjnxnoeq

Study of Wireless Sensor Network Route Based on Improved Ant Colony Algorithm

Jingyi Bo, Yubin Wang, Na Xu
2016 International Journal of Online Engineering (iJOE)  
This algorithm takes the energy factor into the consideration of selection of route based on probability and enhanced calculation of information so as to find out the optimal route from the source node  ...  is applied to a wireless sensor network, and a wireless sensor network route algorithm based on energy equilibrium is proposed in this paper.  ...  colony algorithm, so the ACO provides a new direction for solving network route problems [5] .  ... 
doi:10.3991/ijoe.v12i10.6196 fatcat:zxizvnyt7va57p2ixyppepvcvu

DeviceLevel Early Floorplanning Algorithms for RF Circuits [chapter]

2009 Computer-Aided Design of Analog Integrated Circuits and Systems  
This paper develops a floorplanner for RF circuits based on a genetic algorithm (GA) that supports fully simultaneous placement and routing.  ...  Experimental results demonstrate the ability of this approach to successfully optimize for wire planarity, realize multiple constraints on net lengths or phases, and achieve reasonable area in modest CPU  ...  We are grateful to Mitch Mlinar of HP-EEsof for several insightful discussions of the potential role of genetic optimization in device-level RF layout.  ... 
doi:10.1109/9780470544310.ch41 fatcat:sypxxwxrpzfdrmftgxyfw6ikpm

Optimal Oblivious Routing in Hole-Free Networks [chapter]

Costas Busch, Malik Magdon-Ismail
2012 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
This congestion bound is asymptotically worst-case optimal for oblivious routing algorithms.  ...  We give an oblivious routing algorithm for the class of hole-free networks, in which the nodes are topologically embedded in simple areas of the plane.  ...  optimal O(C + D), where D is the maximum path length of the routing algorithm.  ... 
doi:10.1007/978-3-642-29222-4_30 fatcat:ft4yenkc65hplelqn5jerkbari

Fashion: A Fast and Accurate Solution to Global Routing Problem

Zhen Cao, Tom Tong Jing, Jinjun Xiong, Yu Hu, Zhe Feng, Lei He, Xian-Long Hong
2008 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
This paper presents a fast and accurate solution, namely Fashion, to routability-driven global routing problem.  ...  Fashion is based on two efficient yet effective techniques: 1) dynamic pattern routing (DPR) and 2) movable-segment-driven DPR.  ...  Chu from Iowa State University for providing the source code of FLUTE.  ... 
doi:10.1109/tcad.2008.917590 fatcat:scwdi7mz3fgzjppjkryodegxw4

Device-level early floorplanning algorithms for RF circuits

Mehmet Aktuna, Rob A. Rutenbar, L. Richard Carley
1998 Proceedings of the 1998 international symposium on Physical design - ISPD '98  
This paper develops a floorplanner for radio-frequency circuits based on a genetic algorithm (GA) that supports fully simultaneous placement and routing.  ...  Experimental results demonstrate the ability of this approach to successfully optimize for wire planarity, realize multiple constraints on net lengths or phases, and achieve reasonable area in modest CPU  ...  Mlinar of HP-EEsof for several insightful discussions of the potential role of genetic optimization in device-level RF layout.  ... 
doi:10.1145/274535.274543 dblp:conf/ispd/AktunaRC98 fatcat:ua6bxiz2gzayhf6hfipat6pwqy

Device-level early floorplanning algorithms for RF circuits

M. Aktuna, R.A. Rutenbar, L.R. carley
1999 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
This paper develops a floorplanner for radio-frequency circuits based on a genetic algorithm (GA) that supports fully simultaneous placement and routing.  ...  Experimental results demonstrate the ability of this approach to successfully optimize for wire planarity, realize multiple constraints on net lengths or phases, and achieve reasonable area in modest CPU  ...  Mlinar of HP-EEsof for several insightful discussions of the potential role of genetic optimization in device-level RF layout.  ... 
doi:10.1109/43.752922 fatcat:ujzxgtemknakhp5cga4dgymsji
« Previous Showing results 1 — 15 out of 52,014 results