Log in

Relevant bibliographies by topics / Longest Path Algorithm / Journal articles

To see the other types of publications on this topic, follow the link: Longest Path Algorithm.

Journal articles on the topic 'Longest Path Algorithm'

Author: Grafiati

Published: 7 June 2025

Last updated: 2 August 2025

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Longest Path Algorithm.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

UEHARA, RYUHEI, and YUSHI UNO. "ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES." International Journal of Foundations of Computer Science 18, no. 05 (2007): 911–30. http://dx.doi.org/10.1142/s0129054107005054.

Full text

Abstract:

The longest path problem is the one that finds a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, few graph classes are known to be solved efficiently for the longest path problem. Among those, for trees, a simple linear time algorithm for the longest path problem is known. We first generalize the algorithm, and show that the longest path problem can be solved efficiently for some tree-like graph classes by this approach. We next propose two new graph classes that have natural interval representation

APA, Harvard, Vancouver, ISO, and other styles

2

Han, Xiaokang, Wenzhou Yan, and Mei Lu. "Intelligent Critical Path Computation Algorithm Utilising Ant Colony Optimisation for Complex Project Scheduling." Complexity 2021 (July 2, 2021): 1–8. http://dx.doi.org/10.1155/2021/9930113.

Full text

Abstract:

In large and complex project schedule networks, existing algorithms to determine the critical path are considerably slow. Therefore, an algorithm with a faster convergence is needed to improve the efficiency of the critical path computation. The ant colony algorithm was first applied to the travelling salesman problem to determine the shortest path. However, many problems require the longest path in practice; the critical path in the scheduling problem is the longest path in the scheduling network. In this study, an improved ant colony algorithm to determine the critical path by setting the pa

APA, Harvard, Vancouver, ISO, and other styles

3

Wei, Shiwei, Yuping Wang, Yuanchao Yang, and Sen Liu. "A path recorder algorithm for Multiple Longest Common Subsequences (MLCS) problems." Bioinformatics 36, no. 10 (2020): 3035–42. http://dx.doi.org/10.1093/bioinformatics/btaa134.

Full text

Abstract:

Abstract Motivation Searching the Longest Common Subsequences of many sequences is called a Multiple Longest Common Subsequence (MLCS) problem which is a very fundamental and challenging problem in many fields of data mining. The existing algorithms cannot be applicable to problems with long and large-scale sequences due to their huge time and space consumption. To efficiently handle large-scale MLCS problems, a Path Recorder Directed Acyclic Graph (PRDAG) model and a novel Path Recorder Algorithm (PRA) are proposed. Results In PRDAG, we transform the MLCS problem into searching the longest pa

APA, Harvard, Vancouver, ISO, and other styles

4

Liu, Huanlin, Hongyue Dai, Fei Zhai, Yong Chen, and Chengying Wei. "Longest Path Reroute to Optimize the Optical Multicast Routing in Sparse Splitting WDM Networks." International Journal of Optics 2015 (2015): 1–6. http://dx.doi.org/10.1155/2015/489356.

Full text

Abstract:

Limited by the sparse light-splitting capability in WDM networks, some nodes need to reroute the optical packet to different destination nodes with the high cost of routing for reducing packet loss possibility. In the paper, the longest path reroute optimization algorithm is put forward to jointly optimize the multicast routing cost and wavelength channel assignment cost for sparse splitting WDM networks. Based on heuristic algorithms, the longest path reroute routing algorithm calls multiple longest paths in existing multicast tree to reroute the path passing from the nodes which are violatin

APA, Harvard, Vancouver, ISO, and other styles

5

Marzo, Ruslán G., and Celso C. Ribeiro. "Exact and approximate algorithms for the longest induced path problem." RAIRO - Operations Research 55, no. 2 (2021): 333–53. http://dx.doi.org/10.1051/ro/2021004.

Full text

Abstract:

The longest induced path problem consists in finding a maximum subset of vertices of a graph such that it induces a simple path. We propose a new exact enumerative algorithm that solves problems with up to 138 vertices and 493 edges and a heuristic for larger problems. Detailed computational experiments compare the results obtained by the new algorithms with other approaches in the literature and investigate the characteristics of the optimal solutions.

APA, Harvard, Vancouver, ISO, and other styles

6

Ramadhan, Duaa, Abdulmuttalib Rashid, and Osama Rashid. "Two Dimensional Path Planning with Static Polygon Obstacles Avoidance." 3D SCEEER Conference sceeer, no. 3d (2020): 65–72. http://dx.doi.org/10.37917/10.37917/ijeee.sceeer.3rd.10.

Full text

Abstract:

This paper presents the designing of path planning system in an environment contains a set of static polygon obstacles localized and distributed randomly by using differential drive mobile robot. In this paper the designed algorithm (two dimensional path planning algorithm) is proposed in order of investigate the path planning of mobile robot with free collision using the visibility binary tree algorithm. The suggested algorithm is compared with the virtual circles tangents algorithm in the time of arrival and the longest of the path to the target. The aim of this paper is to get an algorithm

APA, Harvard, Vancouver, ISO, and other styles

7

Ramadhan, Duaa, Abdulmuttalib Rashid, and Osama Rashid. "Two Dimensional Path Planning with Static Polygon Obstacles Avoidance." 3D SCEEER Conference sceeer, no. 3d (2020): 65–72. http://dx.doi.org/10.37917/ijeee.sceeer.3rd.10.

Full text

Abstract:

This paper presents the designing of path planning system in an environment contains a set of static polygon obstacles localized and distributed randomly by using differential drive mobile robot. In this paper the designed algorithm (two dimensional path planning algorithm) is proposed in order of investigate the path planning of mobile robot with free collision using the visibility binary tree algorithm. The suggested algorithm is compared with the virtual circles tangents algorithm in the time of arrival and the longest of the path to the target. The aim of this paper is to get an algorithm

APA, Harvard, Vancouver, ISO, and other styles

8

Phuong, Nguyen Thi, Tran Vinh Duc, and Le Cong Thanh. "On the Performance of a Simple Approximation Algorithm for the Longest Path Problem." Journal of Computer Science and Cybernetics 35, no. 1 (2019): 57–68. http://dx.doi.org/10.15625/1813-9663/35/1/12935.

Full text

Abstract:

The longest path problem is known to be NP-hard. Moreover, they cannot be approximated within a constant ratio, unless ${\rm P=NP}$. The best known polynomial time approximation algorithms for this problem essentially find a path of length that is the logarithm of the optimum.In this paper we investigate the performance of an approximation algorithm for this problem in almost every case. We show that a simple algorithm, based on depth-first search, finds on almost every undirected graph $G=(V,E)$ a path of length more than $|V|-3\sqrt{|V| \log |V|}$ and so has performance ratio less than $1+4\

APA, Harvard, Vancouver, ISO, and other styles

9

Abinaya, B., and E. C. Henry Amirtharaj. "An Alternative Method for Finding the Critical Path of the Network in Fuzzy Time Cost Trade off Problem." Indian Journal Of Science And Technology 17, no. 10 (2024): 949–54. http://dx.doi.org/10.17485/ijst/v17i10.3143.

Full text

Abstract:

Background : The critical path approach is used to determine the network's longest path, according to historical records. This study examines a different approach to determining the construction network's longest path. Method: Here, the network is viewed as a directed acyclic graph, and the critical path of the network is found using the longest path algorithm of the network. To find the best answer for a building project, the longest path that was found was integrated into a linear programming issue. The triangle fuzzy variable defines all of the project's inputs. The 992 square foot building

APA, Harvard, Vancouver, ISO, and other styles

10

Keshavarz-Kohjerdi, Fatemeh, and Ruo-Wei Hung. "The Longest (s, t)-Path Problem on O-Shaped Supergrid Graphs." Mathematics 11, no. 12 (2023): 2712. http://dx.doi.org/10.3390/math11122712.

Full text

Abstract:

The longest (s,t)-path problem on supergrid graphs is known to be NP-complete. However, the complexity of this problem on supergrid graphs with or without holes is still unknown.In the past, we presented linear-time algorithms for solving the longest (s,t)-path problem on L-shaped and C-shaped supergrid graphs, which form subclasses of supergrid graphs without holes. In this paper, we will determine the complexity of the longest (s,t)-path problem on O-shaped supergrid graphs, which form a subclass of supergrid graphs with holes. These graphs are rectangular supergrid graphs with rectangular h

APA, Harvard, Vancouver, ISO, and other styles

11

Liu, Wenbin, and Dongbing Liu. "Dynamic Adjustment Strategy of Rail Guide Vehicle." Mobile Information Systems 2021 (October 30, 2021): 1–9. http://dx.doi.org/10.1155/2021/1433552.

Full text

Abstract:

For the dynamic adjustment strategy of intelligent rail guide vehicle, the dynamic planning model has been built with the longest working time in the paper. In solving this problem, the longest target of the rail guide vehicles’ running time is converted to find the optimal moving path of the rail guide vehicles. Drawing on the shortest path idea, the model uses the Floyd algorithm and the simulated annealing algorithm. The longest running time of the rail guide vehicles in the model is the innovation point in the paper. When the rail guide vehicles path is optimal, when the rail guide vehicle

APA, Harvard, Vancouver, ISO, and other styles

12

Markov, Minko, Mugurel Andreica, Krassimir Manev, and Nicolae Tapus. "A Linear Time Algorithm for Computing Longest Paths in Cactus Graphs." Serdica Journal of Computing 6, no. 3 (2012): 287–98. http://dx.doi.org/10.55630/sjc.2012.6.287-298.

Full text

Abstract:

We propose an algorithm that computes the length of a longest path in a cactus graph. Our algorithm can easily be modified to output a longest path as well or to solve the problem on cacti with edge or vertex weights. The algorithm works on rooted cacti and assigns to each vertex a two-number label, the first number being the desired parameter of the subcactus rooted at that vertex. The algorithm applies the divide-and-conquer approach and computes the label of each vertex from the labels of its children. The time complexity of our algorithm is linear in the number of vertices, thus improving

APA, Harvard, Vancouver, ISO, and other styles

13

Sudo, Yuichi, Ajoy K. Datta, Lawrence L. Larmore, and Toshimitsu Masuzawa. "Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees." Parallel Processing Letters 28, no. 01 (2018): 1850002. http://dx.doi.org/10.1142/s0129626418500020.

Full text

Abstract:

Self-stabilizing, but non-silent, distributed algorithms, for center finding in chain and tree networks are presented in the link register model. We assume that there exists a designated root in a chain and a tree. Under this assumption, both algorithms find the unique center or one of the two centers of the network within O(diam) rounds under the unfair daemon, where diam is the diameter of the network. Both algorithms use constant space, both per process and per link register. The basic strategy of the chain algorithm is based on two synchronized waves of different speeds; one wave is three

APA, Harvard, Vancouver, ISO, and other styles

14

B, Abinaya, and C. Henry Amirtharaj E. "An Alternative Method for Finding the Critical Path of the Network in Fuzzy Time Cost Trade off Problem." Indian Journal of Science and Technology 17, no. 10 (2024): 949–54. https://doi.org/10.17485/IJST/v17i10.3143.

Full text

Abstract:

Abstract <strong>Background :</strong> The critical path approach is used to determine the network's longest path, according to historical records. This study examines a different approach to determining the construction network's longest path. <strong>Method:</strong> Here, the network is viewed as a directed acyclic graph, and the critical path of the network is found using the longest path algorithm of the network. To find the best answer for a building project, the longest path that was found was integrated into a linear programming issue. The triangle fuzzy variable defines

APA, Harvard, Vancouver, ISO, and other styles

15

Fieger, Kai, Tomas Balyo, Christian Schulz, and Dominik Schreiber. "Finding Optimal Longest Paths by Dynamic Programming in Parallel." Proceedings of the International Symposium on Combinatorial Search 10, no. 1 (2021): 61–69. http://dx.doi.org/10.1609/socs.v10i1.18503.

Full text

Abstract:

We propose an exact algorithm for solving the longest path problem between two given vertices in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster than other state-of-the-art methods. This enables us to solve instances that were previously unsolved and solve hard instances significantly faster. We also present a parallel version of the algorithm.

APA, Harvard, Vancouver, ISO, and other styles

16

Taylor, Alison M. "Cancer Genomes Sometimes Take the Longest Evolutionary Road." Cancer Discovery 14, no. 10 (2024): 1766–67. http://dx.doi.org/10.1158/2159-8290.cd-24-1017.

Full text

Abstract:

Summary: Baker and colleagues developed a new algorithm called “Gain Route Identification and Timing In Cancer” (GRITIC) to uncover the path of chromosomal evolution in a tumor, particularly in the context of whole-genome duplication. Their approach found that tumors with genome doubling frequently take an indirect path from one copy number state to another. In addition, the timing of genome doubling within a tumor’s evolution impacts its consequences on downstream chromosomal instability. See related article by Baker et al., p. 1810

APA, Harvard, Vancouver, ISO, and other styles

17

Keshavarz-Kohjerdi, Fatemeh, and Alireza Bagheri. "An efficient parallel algorithm for the longest path problem in meshes." Journal of Supercomputing 65, no. 2 (2013): 723–41. http://dx.doi.org/10.1007/s11227-012-0852-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Reyzin, Lev, and Nikhil Srivastava. "On the longest path algorithm for reconstructing trees from distance matrices." Information Processing Letters 101, no. 3 (2007): 98–100. http://dx.doi.org/10.1016/j.ipl.2006.08.013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Sherali, Hanif D., and Chiun-Ming Liu. "Identification of a Network Substructure and Some Algorithmic Considerations for Large-Scale Harvest Scheduling Problems." Forest Science 36, no. 3 (1990): 599–613. http://dx.doi.org/10.1093/forestscience/36.3.599.

Full text

Abstract:

Abstract Berck and Bible (1984) have suggested a solution approach for harvest scheduling problems based on the Dantzig-Wolfe (1960) decomposition algorithm. We first expose the fact that the area constraints in their problem possess a network structure, requiring the solution of a single longest path problem, and show that the elegant dosed-form solution derived by Berck and Bible is precisely a readily obtained longest path solution. Moreover, we show that when additional variable bounds are imposed, the network structure remains exploitable. Second, we compare the computational effort and s

APA, Harvard, Vancouver, ISO, and other styles

20

Messaoudi-Ouchene, Mohamed, and Ali Derbala. "A Modified Ant Colony Algorithm to the P| Prec| Cmax Scheduling Problem." International Journal of Applied Metaheuristic Computing 4, no. 3 (2013): 65–74. http://dx.doi.org/10.4018/ijamc.2013070105.

Full text

Abstract:

This paper investigates a comparative study which addresses the P/prec/Cmax scheduling problem, a notable NP-hard benchmark. MLP_SACS, a modified ant colony algorithm, is used to solve it. Its application provides us a better job allocation to machines. In front of each machine, the jobs are performed with three priority rules, the longest path (LP), a modified longest path (MLP) and a maximum between two values (MAX). With these three rules and with both static and dynamic information heuristics called “visibility”, six versions of this ant colony algorithm are obtained, studied and compared.

APA, Harvard, Vancouver, ISO, and other styles

21

Vassilev, Tzvetalin, and Joanna Ammerlaan. "Programming and Testing a Two-Tree Algorithm." Serdica Journal of Computing 7, no. 2 (2013): 115–34. http://dx.doi.org/10.55630/sjc.2013.7.115-134.

Full text

Abstract:

Recently, Markov, Vassilev and Manev [2] proposed an algorithm for finding the longest path in 2-trees. In this paper, we describe an implementation of the algorithm. We briefly discuss the algorithm and present example that helps the reader grasp the main algorithmic ideas. Further, we discuss the important stages in the implementation of the algorithm and justify the decisions taken. Then, we present experimental results and discuss them in the light of the dependence on the platform and machine architecture. We present timing analysis of the implementation, as well as results on the average

APA, Harvard, Vancouver, ISO, and other styles

22

Mertzios, George B., and Derek G. Corneil. "A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs." SIAM Journal on Discrete Mathematics 26, no. 3 (2012): 940–63. http://dx.doi.org/10.1137/100793529.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Ishizeki, Tetsuya, Yota Otachi, and Koichi Yamazaki. "An improved algorithm for the longest induced path problem onk-chordal graphs." Discrete Applied Mathematics 156, no. 15 (2008): 3057–59. http://dx.doi.org/10.1016/j.dam.2008.01.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Asgharian Sardroud, Asghar, and Alireza Bagheri. "An approximation algorithm for the longest path problem in solid grid graphs." Optimization Methods and Software 31, no. 3 (2016): 479–93. http://dx.doi.org/10.1080/10556788.2015.1130130.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Bai, Xiazu. "Application of Improving ABC in Cold Chain Low Carbon Logistics Path Planning." Scalable Computing: Practice and Experience 24, no. 3 (2023): 229–40. http://dx.doi.org/10.12694/scpe.v24i3.2357.

Full text

Abstract:

The market has set higher efficiency and environmental requirements for cold chain logistics, and path planning plays an important role. This study proposes a low-carbon cold chain logistics path planning model based on an improved artificial bee colony algorithm (this paragraph refers to ”fusion algorithm”). The study first establishes the fusion algorithm. Then, in response to the shortcomings of this algorithm, the artificial fish swarm algorithm and genetic algorithm are used to improve it. The final results express that the shortest distance for solving Eil51 using this algorithm is 421.3

APA, Harvard, Vancouver, ISO, and other styles

26

Levner, Eugene, Amir Elalouf, and T. C. Cheng. "An Improved FPTAS for Mobile Agent Routing with Time Constraints." JUCS - Journal of Universal Computer Science 17, no. (13) (2011): 1854–62. https://doi.org/10.3217/jucs-017-13-1854.

Full text

Abstract:

Camponogara and Shima (2010) developed an ε-approximation algorithm (FPTAS) for the mobile agent routing problem in which a benefit function determines how visits to different sites contribute to the agent's mission. The benefit is to be maximized under a time constraint. They reduced the problem to the constrained longest-path problem in a graph. In this note we present a modified FPTAS that improves on their result by a factor of , where and are an upper bound and a lower bound on the maximum benefit, respectively, n is the number of nodes, and h is the length of the longest path (in hops) i

APA, Harvard, Vancouver, ISO, and other styles

27

Kang, YeFei, ZhiBin Li, and Tao Wang. "Application of PID Control and Improved Ant Colony Algorithm in Path Planning of Substation Inspection Robot." Mathematical Problems in Engineering 2022 (August 23, 2022): 1–10. http://dx.doi.org/10.1155/2022/9453219.

Full text

Abstract:

The purpose is to improve the effect of substation inspection and ensure the safety of power consumption in human society. First, this work discusses the current substation inspection-oriented robot path planning situation. Then, the proportional integration differentiation (PID) control algorithm is introduced and optimized. Ant colony algorithm (ACA) is improved. The substation inspection-oriented RPP model is designed based on the PID algorithm and optimized ACA (the proposed model is denoted as the Ant-PID algorithm). Afterward, the Ant-PID algorithm is compared with the PID control algori

APA, Harvard, Vancouver, ISO, and other styles

28

Camponogara, Eduardo, and Ricardo Shima. "Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach." JUCS - Journal of Universal Computer Science 16, no. (3) (2010): 372–401. https://doi.org/10.3217/jucs-016-03-0372.

Full text

Abstract:

Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit several sites where it collects resources to accomplish its mission. This gives rise to the mobile-agent itinerary problem (MIP) which seeks a route maximizing overall benefit from the resources while meeting a deadline. This paper formalizes MIP and develops a reduction to the resource constrained longest-path problem (CLPP) in acyclic graphs. A dynamic programming (DP) algorithm was designed to produce a family of optimal

APA, Harvard, Vancouver, ISO, and other styles

29

Korkhov, Vladimir, Ivan Gankevich, Anton Gavrikov, et al. "Finding Bottlenecks in Message Passing Interface Programs by Scalable Critical Path Analysis." Algorithms 16, no. 11 (2023): 505. http://dx.doi.org/10.3390/a16110505.

Full text

Abstract:

Bottlenecks and imbalance in parallel programs can significantly affect performance of parallel execution. Finding these bottlenecks is a key issue in performance analysis of MPI programs especially on a large scale. One of the ways to discover bottlenecks is to analyze the critical path of the parallel program: the longest execution path in the program activity graph. There are a number of methods of finding the critical path; however, most of them suffer a performance drop when scaled. In this paper, we analyze several methods of critical path finding based on classical Dijkstra and Delta-st

APA, Harvard, Vancouver, ISO, and other styles

30

Podsiadło, Krzysztof, Albert Oliver Serra, Anna Paszyńska, et al. "Parallel graph-grammar-based algorithm for the longest-edge refinement of triangular meshes and the pollution simulations in Lesser Poland area." Engineering with Computers 37, no. 4 (2021): 3857–80. http://dx.doi.org/10.1007/s00366-020-01253-y.

Full text

Abstract:

AbstractIn this paper, we propose parallel graph-grammar-based algorithm for the longest-edge refinements and the pollution simulations in Lesser Poland area. We introduce graph-grammar productions for Rivara’s longest-edged algorithm for the local refinement of unstructured triangular meshes. We utilize the hyper-graph to represent the computational mesh and the graph-grammar productions to express the longest-edge mesh refinement algorithm. The parallelism in the original Rivara’s longest edge refinement algorithm is obtained by processing different longest edge refinement paths in different

APA, Harvard, Vancouver, ISO, and other styles

31

BESPAMYATNIKH, SERGEI. "AN OPTIMAL MORPHING BETWEEN POLYLINES." International Journal of Computational Geometry & Applications 12, no. 03 (2002): 217–28. http://dx.doi.org/10.1142/s0218195902000839.

Full text

Abstract:

We address the problem of continuously transforming or morphing one simple polyline into another so that every point p of the initial polyline moves to a point q of the final polyline using the geodesic shortest path from p to q. We optimize the width of the morphing, that is, the longest path made by a point on the polyline. We present an algorithm for finding the minimum width morphing in O(n2) time using O(n) space, where n is the total number of vertices of polylines. This improves the previous algorithm7 by a factor of log 2 n.

APA, Harvard, Vancouver, ISO, and other styles

32

Cho, Huidae. "A recursive algorithm for calculating the longest flow path and its iterative implementation." Environmental Modelling & Software 131 (September 2020): 104774. http://dx.doi.org/10.1016/j.envsoft.2020.104774.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Keshavarz-Kohjerdi, Fatemeh, Alireza Bagheri, and Asghar Asgharian-Sardroud. "A linear-time algorithm for the longest path problem in rectangular grid graphs." Discrete Applied Mathematics 160, no. 3 (2012): 210–17. http://dx.doi.org/10.1016/j.dam.2011.08.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Xu, Lili, Lin Wang, and Minmin Zhu. "Application of BIM Technology in Structural Design of Prefabricated Building Based on Big Data Simulation Modeling Analysis." Scalable Computing: Practice and Experience 25, no. 4 (2024): 2862–75. http://dx.doi.org/10.12694/scpe.v25i4.2854.

Full text

Abstract:

Aiming at the complex steel bar layout problem in prefabricated building, this research proposes a structural design method of prefabricated building based on big data simulation modeling building information modeling technology. It includes the reinforcement arrangement model based on agent path planning, the intelligent reinforcement arrangement of frame based on artificial potential field method and path optimization, and the modeling of Building information modeling. When analyzing the reinforcement arrangement effect of beam column joints in Prefabricated building, the calculation time of

APA, Harvard, Vancouver, ISO, and other styles

35

Kong, Liang Liang, and Lin Chen. "A Worst-Case Execution Time Analysis Approach Based on AOE Networks." Advanced Materials Research 791-793 (September 2013): 1726–29. http://dx.doi.org/10.4028/www.scientific.net/amr.791-793.1726.

Full text

Abstract:

To overcome disadvantages of traditional worst-case execution time (WCET) analysis approaches, this paper proposes a new WCET analysis approach based on AOE networks for ARM programs. By assigning the execution times of program segments to weights of directed edges, we reformulated the analysis of the WCET of the program as finding the longest path in a weighted directed graph. An algorithm implemented in this paper is used to search the longest path in the weighted directed graph and gives the WCET estimate finally. Experimental results have shown the analysis approach proposed in this paper

APA, Harvard, Vancouver, ISO, and other styles

36

Gang, Zou, Shao Zhibiao, and Li Linghao. "Research of 64-bits RISC Dual-core Microprocessor with High Performance and Low Power Consumption." TELKOMNIKA Telecommunication, Computing, Electronics and Control 16, no. 2 (2018): 463–70. https://doi.org/10.12928/TELKOMNIKA.v16i2.4153.

Full text

Abstract:

A 64-bits RISC Dual-Core microprocessor with high performance and low power consumption is presented in this paper. The processor has a symmetric architecture with two cores. Each of them has three stage pipeline, 64-bit data-path and 64-bit address port. A novel shared register module, redundant Booth3 algorithm and leapfrog Wallace tree architecture are introduced to the microprocessor, and both the performance and power consumption of it has been improved enormously. As the FPGA simulation result indicates, the power consumption is decreased by 14% and the longest data-path is shortened by

APA, Harvard, Vancouver, ISO, and other styles

37

Keshavarz-Kohjerdi, Fatemeh, and Ruo-Wei Hung. "Finding Hamiltonian and Longest (s,t)-Paths of C-Shaped Supergrid Graphs in Linear Time." Algorithms 15, no. 2 (2022): 61. http://dx.doi.org/10.3390/a15020061.

Full text

Abstract:

A graph is called Hamiltonian connected if it contains a Hamiltonian path between any two distinct vertices. In the past, we proved the Hamiltonian path and cycle problems for general supergrid graphs to be NP-complete. However, they are still open for solid supergrid graphs. In this paper, first we will verify the Hamiltonian cycle property of C-shaped supergrid graphs, which are a special case of solid supergrid graphs. Next, we show that C-shaped supergrid graphs are Hamiltonian connected except in a few conditions. For these excluding conditions of Hamiltonian connectivity, we compute thei

APA, Harvard, Vancouver, ISO, and other styles

38

Gustami, Heri, Muhammad Rizal, and Riyadhul Fajri. "The Determination of Availability Path Planning in Natural Tourist Attractions using Dijkstra's Algorithm and Ant Colony Optimization." Journal of Computer System and Informatics (JoSYC) 6, no. 1 (2024): 265–73. https://doi.org/10.47065/josyc.v6i1.6336.

Full text

Abstract:

The research on determining Availability Path Planning for natural tourist attractions using Dijkstra and Ant Colony algorithms aims to identify the most efficient routes in terms of time, distance, and environmental conditions. This is achieved by combining the Dijkstra and Ant Colony Optimization algorithms, each with its respective advantages and disadvantages, to create a system for finding the shortest, fastest, and safest paths to natural tourist destinations in Bireuen Regency. The methodology employed in this study is the waterfall model, which encompasses stages from analysis to appli

APA, Harvard, Vancouver, ISO, and other styles

39

Kamesheva, Saniya Bolatkizy, Mark Vladislavovich Mamchenko, and Rinat Romanovich Galin. "RESULTS OF THE RESEARCH ON THE ALLOCATION OF TASKS IN A COLLABORATIVE ROBOTIC SYSTEM WITH MINIMIZATION OF THEIR EXECUTION TIME." Chronos 7, no. 11(73) (2022): 103–7. http://dx.doi.org/10.52013/2658-7556-73-11-29.

Full text

Abstract:

The article presents a generalized algorithm for allocation of tasks in a collaborative robotic system with minimizing the time of their execution (an algorithm of assigning the performers to work within the technological process), as well as the results of modeling the developed algorithm. The maximum value among the sums of the edge weights for the longest path from the source of the graph to its drain is used as the execution time of the technological process that needs to be minimized.

APA, Harvard, Vancouver, ISO, and other styles

40

Nkambu, Ngoma R. "Study of the Structure of Graphs in the Optimal Path Problem: Application of Richards BELLMAN Algorithms." International Journal of Mathematics and Computer Research 13, no. 06 (2025): 5285–91. https://doi.org/10.5281/zenodo.15581930.

Full text

Abstract:

Data structures play an important role in problem modeling. Graphs model so many other in different domains, one always has to maximize or minimize the time or either the cost in a routing or scheduling problem. Transport networks and scheduling problems are two areas where optimization plays a key role. In this article, we are talking about how to adapt certain types of data by the graph structure. And we study the Shortest Path (SPC) and Longest Path (LPL) problem by applying BELLMAN's algorithms and see how these can be applied in scheduling when it comes to projects. An implementation of t

APA, Harvard, Vancouver, ISO, and other styles

41

Dong, Feihu, Yasheng Zhang, Guiyu Liu, Hongzhi Yu, and Chenhua Sun. "Delay-Sensitive Service Provisioning in Software-Defined Low-Earth-Orbit Satellite Networks." Electronics 12, no. 16 (2023): 3474. http://dx.doi.org/10.3390/electronics12163474.

Full text

Abstract:

With the advancement of space technology and satellite communications, low-Earth-orbit (LEO) satellite networks have experienced rapid development in the past decade. In the vision of 6G, LEO satellite networks play an important role in future 6G networks. On the other hand, a variety of applications, including many delay-sensitive applications, are continuously emerging. Due to the highly dynamic nature of LEO satellite networks, supporting time-deterministic services in such networks is challenging. However, we can provide latency guarantees for most delay-sensitive applications through data

APA, Harvard, Vancouver, ISO, and other styles

42

Zhu, Lei, Jacob R. Holden, and Jeffrey D. Gonder. "Trajectory Segmentation Map-Matching Approach for Large-Scale, High-Resolution GPS Data." Transportation Research Record: Journal of the Transportation Research Board 2645, no. 1 (2017): 67–75. http://dx.doi.org/10.3141/2645-08.

Full text

Abstract:

With the development of smartphones and portable GPS devices, large-scale, high-resolution GPS data can be collected. Map matching is a critical step in studying vehicle driving activity and recognizing network traffic conditions from the data. A new trajectory segmentation map-matching algorithm is proposed to deal accurately and efficiently with large-scale, high-resolution GPS trajectory data. The new algorithm separated the GPS trajectory into segments. It found the shortest path for each segment in a scientific manner and ultimately generated a best-matched path for the entire trajectory.

APA, Harvard, Vancouver, ISO, and other styles

43

Korf, Richard E. "Finding the Exact Diameter of a Graph with Partial Breadth-First Searches." Proceedings of the International Symposium on Combinatorial Search 12, no. 1 (2021): 73–78. http://dx.doi.org/10.1609/socs.v12i1.18553.

Full text

Abstract:

The diameter of a graph is the longest shortest path between two nodes. This paper presents an improved algorithm for finding the exact diameter of an undirected graph. Rather than performing complete breadth-first searches, these searches can be terminated early. The algorithm is readily parallelized, and is used to find the diameters of 4-peg Tower of Hanoi problem-space graphs with up to 18 discs. Performance improvements range from a factor of almost 2 to 5.88 over the previous state of the art.

APA, Harvard, Vancouver, ISO, and other styles

44

VENEMA, SVEN, HONG SHEN, and FRANCIS SURAWEERA. "NC ALGORITHMS FOR THE SINGLE MOST VITAL EDGE PROBLEM WITH RESPECT TO ALL PAIRS SHORTEST PATHS." Parallel Processing Letters 10, no. 01 (2000): 51–58. http://dx.doi.org/10.1142/s012962640000007x.

Full text

Abstract:

For a weighted, undirected graph G=(V, E) where |V|=n and |E|=m, we examine the single most vital edge with respect to all-pairs shortest paths (APSP) under two different measurements. The first measurement considers only the impact of the removal of a single edge from the APSP on the shortest distance between each vertex pair. The second considers the total weight of all the edges which make up the APSP, that is, calculate the sum of the distance between each vertex pair after the deletion of any edge belonging to a shortest path. We give a sequential algorithm for this problem, and show how

APA, Harvard, Vancouver, ISO, and other styles

45

Erbil, Mustafa Emre, Merdan Özkahraman, and Hilmi Cenk Bayrakçı. "Comprehensive Performance Analysis and Evaluation of Various Maze Solving Algorithms for Optimized Autonomous Navigation and Pathfinding." Fırat Üniversitesi Mühendislik Bilimleri Dergisi 37, no. 1 (2024): 151–66. https://doi.org/10.35234/fumbd.1518386.

Full text

Abstract:

Recent advancements in technology have led to the widespread use of maze-solving algorithms in various applications, such as autonomous robots, GPS-based navigation systems, smart traffic management systems, and healthcare services. This study provides a comprehensive comparative analysis of the performance of several maze-solving algorithms, including A*, Breadth-First Search (BFS), Depth-First Search (DFS), Dijkstra, Flood Fill, Random Mouse, and Recursive Backtracker. The algorithms were evaluated based on key performance metrics such as solution speed, memory usage, and CPU consumption. Th

APA, Harvard, Vancouver, ISO, and other styles

46

Roy, Kalapi, and Carl Sechen. "A Timing-Driven Partitioning System for Multiple FPGAs." VLSI Design 4, no. 4 (1996): 309–28. http://dx.doi.org/10.1155/1996/49565.

Full text

Abstract:

Field-programmable systems with multiple FPGAs on a PCB or an MCM are being used by system designers when a single FPGA is not sufficient. We address the problem of partitioning a large technology mapped FPGA circuit onto multiple FPGA devices of a specific target technology. The physical characteristics of the multiple FPGA system (MFS) pose additional constraints to the circuit partitioning algorithms: the capacity of each FPGA, the timing constraints, the number of I/Os per FPGA, and the pre-designed interconnection patterns of each FPGA and the package. Existing partitioning techniques whi

APA, Harvard, Vancouver, ISO, and other styles

47

Čarapina, Mia, Ognjen Staničić, Ivica Dodig, and Davor Cafuta. "A Comparative Study of Maze Generation Algorithms in a Game-Based Mobile Learning Application for Learning Basic Programming Concepts." Algorithms 17, no. 9 (2024): 404. http://dx.doi.org/10.3390/a17090404.

Full text

Abstract:

This study evaluates several maze generation algorithms applied to generate mazes in a game-based Android mobile application designed to support children in learning basic programming concepts and computational thinking. Each algorithm is assessed for its ability to generate solvable and educationally effective mazes, varying in complexity and size. Key findings indicate that Wilson’s and Aldous–Broder algorithms were identified as the most time inefficient. In comparison, Sidewinder and Binary Tree algorithms perform best for smaller mazes due to their straightforward traversal methods. The H

APA, Harvard, Vancouver, ISO, and other styles

48

BEREG, SERGEY. "AN APPROXIMATE MORPHING BETWEEN POLYLINES." International Journal of Computational Geometry & Applications 15, no. 02 (2005): 193–208. http://dx.doi.org/10.1142/s0218195905001658.

Full text

Abstract:

We consider the problem of continuously transforming or morphing one simple polyline into another polyline so that every point p of the initial polyline moves to a point q of the final polyline using the geodesic shortest path from p to q. The width of a morphing is defined as the longest geodesic path between corresponding points of the polylines. The optimization problem is to compute a morphing that minimizes the width. We present a linear-time algorithm for finding a morphing with width guaranteed to be at most two times the minimum width of a morphing. This improves the previous algorithm

APA, Harvard, Vancouver, ISO, and other styles

49

Wang, Xin Hai. "Research on Fast Application Layer Tree Multicast Algorithm Based on End-to-End Measurement." Advanced Materials Research 159 (December 2010): 46–50. http://dx.doi.org/10.4028/www.scientific.net/amr.159.46.

Full text

Abstract:

Application Layer Multicast (ALM) is more flexible than that in IP layer and easy to optimize for specific applications, so the research on it has become a hotspot. Aiming at the problem of most ALM protocol ignoring bandwidth of covering tree, the paper presented a new heuristic algorithm Max-Delta, which inferred the underlying link topology using end-to-end measurement technology. On the basis of this, a kind of Fast Application layer Tree (FAT) algorithm to construct covering tree was proposed to meet the requirements of bandwidth. In addition, the algorithm's time complexity was also anal

APA, Harvard, Vancouver, ISO, and other styles

50

Chu, Weng-Ming, Koan-Yuh Chang, Chien-Yu Lu, Chang-Hung Hsu, Chien-Hung Liu, and Yung-Chia Hsiao. "A New Approach to Determine the Critical Path in Stochastic Activity Network." Mathematical Problems in Engineering 2014 (2014): 1–13. http://dx.doi.org/10.1155/2014/547627.

Full text

Abstract:

The determination of the critical path (CP) in stochastic networks is difficult. It is partly due to the randomness of path durations and partly due to the probability issue of the selection of the critical path in the network. What we are confronted with is not only the complexity among random variables but also the problem of path dependence of the network. Besides, we found that CP is not necessarily the longest (or shortest) path in the network, which was a conventional assumption in use. The Program Evaluation and Review Technique (PERT) and Critical Path Index (CPI) approaches are not ab

APA, Harvard, Vancouver, ISO, and other styles

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!