Results 91 to 100 of about 10,050 (224)

Identifying Strong Connectivity in Urban Road Networks Considering Traffic Constraints: An Analysis of Road Networks With Different Patterns

open access: yesJournal of Advanced Transportation, Volume 2025, Issue 1, 2025.
Road network connectivity is an important indicator for measuring the operational efficiency and reliability of urban road networks, and it plays an important role in supporting traffic planning and management decisions. The implementation of traffic management measures, such as traffic bans and temporary traffic flow changes, will restrict access to ...
Ruru Xing   +6 more
wiley   +1 more source

Research on multi-load AGV path planning of weaving workshop based on time priority

open access: yesMathematical Biosciences and Engineering, 2019
The multi-load AGV (Automatic Guided Vehicle) is a new kind of materials handling equipment used to load cloth automatically in an intelligent weaving workshop.
Li-zhen Du   +4 more
doaj   +1 more source

Image Redundancy Filtering for Panorama Stitching

open access: yesIEEE Access, 2020
In this paper, we designed a novel framework for massive image panorama stitching, which aims to resolve image redundancy, alignment error accumulation and perspective distortion accumulation of the stitching process.
Xin Wei   +6 more
doaj   +1 more source

Leveraging Nonassociative Algebra for Spectral Analysis of Anomalies in IoT

open access: yesJournal of Applied Mathematics, Volume 2025, Issue 1, 2025.
The constantly changing characteristics of distributed networks and Internet of Things and additionally their susceptibility to anomalies render maintaining security and resilience complicated. This research provides a spectral‐based anomaly detection framework connected with nonassociative algebra, inverse property quasigroup.
Faizah D. Alanazi, Chong Lin
wiley   +1 more source

Modul penghasilan " Painting" sebagai memenuhi hobi dan kerjaya sampingan [PDF]

open access: yes, 2002
Pengajaran berpandukan modul pembelajaran bukanlah satu bentuk pembelajaran yang baru. Sesuai dengan perubahan masa, kuliah pada hari ini telah mengalami perubahan dan ia bukan lagi bentuk pengajaran yang kaku dan pasif.
Mohamad, Maria
core  

Multi-point path planning based on the algorithm of colony-particle swarm optimization

open access: yesTongxin xuebao, 2019
The problem of multi-point path planning is a NP-hard problem,which is equivalent to finding the shortest path of a starting point and some specific node.Aiming at the problem of multi-point path planning,a retrospective ant colony-particle swarm ...
Lijue LIU   +3 more
doaj   +2 more sources

Evaluation of Shortest Paths in Road Network [PDF]

open access: yesPakistan Journal of Commerce and Social Sciences, 2009
Optimization is a key factor in almost all the topics of operations research / management science and economics.The road networks can be optimized within different constraints like time, distance, cost and traffic running onthe roads.This study is based ...
Farrukh Shehzad, Muhammad Akbar Ali Shah
doaj  

Optimal path calculation method of optical network under complex constraints

open access: yesEngineering Reports, Volume 6, Issue 12, December 2024.
In view of the complex logical constraints in SDON services, a unified constraint expression is proposed, and the network topology is layered to transform, creatively solving the urgently needed “and,” “or,” bidirectional link and other logical types in SDON services, constrained path calculation problem.
Peng Zhu   +3 more
wiley   +1 more source

Analisa dan Penerapan Algoritma Floyd Warshal untuk Optimalisasi Jalur Berbasis GPS [PDF]

open access: yes, 2018
Makalah ini membuat tentang masalah dalam menentukan jalur terpendek atau terdekat menuju lokasi pelanggan yang memberikan keluhan, kemudian teknisi akan melakukan penugasan maintenance ke lokasi pelanggan.
Darmawan, R. (Rizki), Ghaniy, R. (Rajib)
core  

Speeding Up Floyd–Warshall’s Algorithm to Compute All-Pairs Shortest Paths and the Transitive Closure of a Graph

open access: yesAlgorithms
Floyd–Warshall’s algorithm is a widely-known procedure for computing all-pairs shortest paths in a graph of n vertices in Θ(n3) time complexity. A simplified version of the same algorithm computes the transitive closure of the graph with the same time ...
Giuseppe Lancia, Marcello Dalpasso
doaj   +1 more source

Home - About - Disclaimer - Privacy