Suchergebnisse - "dijkstra's algorithm"

An Offline Strategic Planning for Service Restoration Using Multi-Constraints Priority-Based Dijkstra’s Algorithm von Sarkar, Dipu, Chakrabarty, Maitrayee, Ghosh, Ritwik, Basak, Raju

“… Dijkstra’s algorithm was used to identify the best partitioning solution. The suggested partitioning solution is evaluated …”
Volltext

Convex wrapping description of biarticular hip muscles for patient-specific musculoskeletal modeling von Wang, Yanbing, Guo, Jianqiao, Tang, Hao, Tian, Qiang

“… The muscle path was then defined as the shortest path wrapped over the convex hull and searched via Dijkstra’s algorithm …”
Volltext

Innovation and Implementation of Teaching Mode of Higher Vocational Advertising Planning Course in the Context of AI Smart Marketing von Zeng, Cuifeng

“… Building upon this foundation, the paper enhances the Dijkstra algorithm and integrates it with the ant colony algorithm to offer personalized learning path recommendations …”
Volltext

Autonomous Ground Vehicle Path Planning in Urban Environments Using GNSS and Cellular Signals Reliability Maps: Models and Algorithms von Ragothaman, Sonya, Maaref, Mahdi, Kassas, Zaher M.

“… In this article, autonomous ground vehicle (AGV) path planning is considered. The AGV is assumed to be equipped with receivers capable of producing pseudorange …”
Volltext

Task Allocation and Trajectory Optimization for Multi‐UAV Cargo Systems with Cellular‐Connected Constraints von Zhang, Borui, Huang, Kui, Chen, Yujing, Yang, Dingcheng

“… To address this, the approach is structured into two principal phases. First, Dijkstra's algorithm is utilized to derive the shortest paths between points while ensuring communication connectivity meets specific quality constraints …”
Volltext

Locomotive assignment problem: integrating the strategic, tactical and operational level aspects von Premkumar, Prashant, Ram Kumar, P. N.

“… ). The LAP is as old as the railways itself. The objective of the LAP is to assign a fleet of locomotives at minimum cost to pre-scheduled trains subject to a host of constraints …”
Volltext

Dijkstra algorithm for nearest route determination and estimated cost of official travel von Alam, C N, Muzaki, F, Irfan, M, Dauni, P, Ramdhani, M A, Rahman, A

“… The analysis model chosen for this DSS is Dijkstra algorithm. The subject of system user is Coordinator of Islamic Higher Education (KOPERTAIS …”
Volltext

Application of Linear Programming Modeling in Multiwave Missile Launch von Ou, Qitong, Du, Chenhong

“… algorithm and 0-1 programming to complete the task allocation model, and used Dijkstra algorithm to carry out path planning for the subsequent transfer of missile …”
Volltext

Control plane delay minimization-based capacitated controller placement algorithm for SDN von Chai, Rong, Yuan, Qiongfang, Zhu, Lei, Chen, Qianbin

“… ; we formulate control plane delay minimization problem subject to controller-switch association constraints, controller capacity constraints, etc …”
Volltext

Mining for genes related to choroidal neovascularization based on the shortest path algorithm and protein interaction information von Zhang, Jian, Suo, Yan, Zhang, Yu-Hang, Zhang, Qing, Chen, XiJia, Xu, Xun, Lu, WenCong

“… Background: Choroidal neovascularization (CNV) is a serious eye disease that may cause visual loss, especially for older people. Many factors have been proven …”
Volltext

Model of Message Transmission across Parallel Route Groups with Dynamic Alternation of These Groups in a Multichannel Steganographic System von Ha, Muon, Tran, Duc-Manh, Shichkina, Yulia

“… Dijkstra’s algorithm with the dynamic utilization of multiple transmission routes. Consequently, this allows the simultaneous transmission of messages through parallel …”
Volltext

Generic Dijkstra: correctness and tractability von Szczesniak, Ireneusz, Wozna-Szczesniak, Bozena

“… The recently-proposed generic Dijkstra algorithm finds shortest paths in networks with continuous and contiguous resources …”
Volltext

Reliability and Connectivity Analysis of Vehicular Ad Hoc Networks under Various Protocols Using a Simple Heuristic Approach von Saajid, Hussain, Di, Wu, Xin, Wang, Memon, Sheeba, Bux, Naadiya Khuda, Aljeroudi, Yazan

“… However, the reliability and connectivity of VANET networks are subjects of concern. In building any routing protocol, a minimum level of network reliability must …”
Volltext

Automatic Breast Tissue Segmentation in MRI Scans von Soleimani, Hossein, Michailovich, Oleg V.

“… This problem has been known to be a challenging one on the account of the complex composition of breast tissue and its extensive inter-subject variability …”
Volltext

Automatic Anisotropic Diffusion Filtering and Graph-search Segmentation of Macular Spectral-domain Optical Coherence Tomographic (SD-OCT) Images von Usha, A, Shajil, Nijisha, Sasikala, M

“… Graph search segmentation using Dijkstra algorithm with a combination of threshold and axial gradient as the cost function is used to segment the retinal …”
Weitere Angaben

Talar dome detection and its geometric approximation in CT: Sphere, cylinder or bi-truncated cone? von Huang, Junbin, Liu, He, Wang, Defeng, Griffith, James F., Shi, Lin

“… ) and bi-truncated cone (BTC). The “talar dome” is well-defined with the improved Dijkstra’s algorithm, considering the Euclidean distance and surface curvature …”
Volltext

TPA: A Two-Phase Approach Using Simulated Annealing for the Optimization of Census Taker Routes in Mexico von Gaona, Silvia, Romero, David

“… Dijkstra’s algorithm to determine the shortest path in this graph. A tuning methodology based on the irace package was used to determine the parameter values for TPA on a subset of 150 instances provided by INEGI. The practical effectiveness of TPA was assessed on another subset of 1962 instances, comparing its performance with that of the in-use heuristic (INEGIH). The results show that TPA clearly outperforms INEGIH. The average improvement is of 47.11% …”
Volltext

Maintenance planning in wind farms with allocation of teams using genetic algorithms von Fonseca, Inacio, Torres Farinha, Jose, Maciel Barbosa, Fernando

“… The paper compares the performance of three methods: genetic algorithms, Dijkstra's algorithm and ant optimization algorithm to the determination of the cheapest path …”
Volltext

High Performance P300 Spellers Using GPT2 Word Prediction With Cross-Subject Training von Parthasarathy, Nithin, Soetedjo, James, Panchavati, Saarang, Parthasarathy, Nitya, Arnold, Corey, Pouratian, Nader, Speier, William

“… We leverage a combination of the second-generation Generative Pre-Trained Transformer (GPT2) and Dijkstra's algorithm to optimize stimuli and suggest word completion choices based on typing history …”
Volltext

Evaluation Of P300 Speller Performance Using Large Language Models Along With Cross-Subject Training von Parthasarathy, Nithin, Soetedjo, James, Panchavati, Saarang, Parthasarathy, Nitya, Arnold, Corey, Pouratian, Nader, Speier, William

“… The P300 speller brain computer interface (BCI) offers an alternative communication medium by leveraging a subject's EEG response to characters traditionally highlighted on a character grid on a graphical user interface (GUI …”
Volltext