Zobrazeno 1 - 10
of 1 441
pro vyhledávání: '"weighted graph"'
Publikováno v:
Machine Learning and Knowledge Extraction, Vol 5, Iss 4, Pp 1905-1920 (2023)
This paper is part of a line of research devoted to developing a compositional and geometric theory of Group Equivariant Non-Expansive Operators (GENEOs) for Geometric Deep Learning. It has two objectives. The first objective is to generalize the not
Externí odkaz:
https://doaj.org/article/55c31ce5fab94e558e2bf0a94cfcfa68
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 1, Pp 16-22 (2024)
AbstractThe aim of this paper is to study the determinant and inverse of the adjacency matrices of weighted and directed versions of Boolean graphs. Our approach is recursive. We describe the adjacency matrix of a weighted Boolean graph in terms of t
Externí odkaz:
https://doaj.org/article/b8eb43a6026e48fd80c0f856dce8072c
Publikováno v:
World Electric Vehicle Journal, Vol 15, Iss 11, p 531 (2024)
Unmanned aerial vehicles (UAVs) play pivotal roles in various applications, from surveillance to delivery services. Efficient path planning for UAVs in dynamic environments with obstacles and moving landing stations is essential to ensure safe and re
Externí odkaz:
https://doaj.org/article/b8ef3dd129b44f609cb8d589fe4246ea
Autor:
Yinping Li, Li Liu
Publikováno v:
Actuators, Vol 13, Iss 10, p 404 (2024)
This article addresses the common issues of insufficient computing power and path congestion for automated guided vehicles (AGVs) in real-world production environments, as well as the shortcomings of traditional path-planning algorithms that mainly c
Externí odkaz:
https://doaj.org/article/d9a2f7d557a44809ba6a5fcd26aa9004
Autor:
Xiaofeng Zhao, Mingao Yuan
Publikováno v:
Mathematics, Vol 12, Iss 17, p 2745 (2024)
In network data analysis, one of the important problems is determining if two collections of networks are drawn from the same distribution. This problem can be modeled in the framework of two-sample hypothesis testing. Several graph-based two-sample
Externí odkaz:
https://doaj.org/article/53dfe092d465453aafd4e525d3e123d0
Publikováno v:
Mathematics, Vol 12, Iss 15, p 2359 (2024)
In this paper, three sorts of network indices for the weighted three-layered graph are studied through the methods of graph spectra theory combined with analysis methods. The concept of union of graphs are applied to design two sorts of weighted laye
Externí odkaz:
https://doaj.org/article/9cefb6e4589c407baf5ddc6e0f7ac4e6
Publikováno v:
Mathematics, Vol 12, Iss 14, p 2206 (2024)
Finding the densest subgraph has tremendous potential in computer vision and social network research, among other domains. In computer vision, it can demonstrate essential structures, and in social network research, it aids in identifying closely ass
Externí odkaz:
https://doaj.org/article/5a7d1b7fbfc7410783abd4fb5d33ab4b
Publikováno v:
Моделирование и анализ информационных систем, Vol 30, Iss 3, Pp 258-263 (2023)
The problem of locating a service center for technical systems with known values of failure flows is considered. This problem was solved using the minisum algorithm of graph theory. The dependence of the system availability factor on the average time
Externí odkaz:
https://doaj.org/article/c6679812feae4d2790de51e2f3470ff3
Publikováno v:
Jurnal Lebesgue, Vol 4, Iss 2, Pp 940-948 (2023)
The determination of the shortest route can be done using various methods, one of which is the Dijkstra algorithm. This algorithm is often used in routing problems with minimum weight in computer networks, communication networks and transportation ne
Externí odkaz:
https://doaj.org/article/f61f711f71314606b9b1cdd399a44437
Publikováno v:
Water Supply, Vol 23, Iss 8, Pp 3432-3452 (2023)
Recently, the scale and complexity of water distribution networks (WDNs) have been increasing with the acceleration of urbanization process. It has become a hot research focus to use district metering area (DMA) for more efficient management and cont
Externí odkaz:
https://doaj.org/article/302bb1d060af408e97ad7da9a8e62855