Results 81 to 90 of about 3,689,343 (292)
IEEE Access, 2020 This paper investigates the consensus of second-order multi-agent systems under switched topologies. Previous studies indicate that a consensus cannot be reached if the topology is fixed and has no spanning tree, but it is possible to reach a consensus ...
Dianhao Zheng +4 more
doaj +1 more source
A Vertex Oriented Approach to Minimum Cost Spanning Tree Problems [PDF]
In this paper we consider spanning tree problems, where n players want to be connected to a source as cheap as possible. We introduce and analyze (n!) vertex oriented construct and charge procedures for such spanning tree situations leading in n steps to
Tijs, S.H., Ciftci, B.B.
core
Spanning trees with generalized degree constraints arising in the design of wireless networks [PDF]
, 2011 In this paper we describe a minimum spanning tree problem with generalized degree constraints which arises in the design of wireless networks. The signal strength on the receiver side of a wireless link decreases with the distance between transmitter and
Luís Gouveia +5 more
core +1 more source
Ultra‐Thin Tow‐Based Discontinuous Composites—Material Overview and Aspirations
Advanced Functional Materials, EarlyView.Tow‐based discontinuous composites made from ultra‐thin tapes offer outstanding in‐plane mechanical properties. This material, inspired by Nacre, has high volume fraction of tapes exceeding 90 % and allows for quasi‐isotropic material plates less than 100 micrometer in thickness.
Ioannis Katsivalis +8 more
wiley +1 more source
Visualisasi Efek Perubahan Fungsi Lahan Menggunakan Maksimum Spanning Tree dengan Pembobot Korelasi
Al-Khwarizmi: Jurnal Pendidikan Matematika dan Ilmu Pengetahuan Alam, 2018 This study aims to visualize the effect of land use change using Maximum Spanning Tree with correlation weight between variables. In addition to know the most dominant factors affect the dependent variable.
Dwi Risky Arifanti
doaj +1 more source
The folk solution and Boruvka's algorithm in minimum cost spanning tree problems [PDF]
The Boruvka's algorithm, which computes the minimum cost spanning tree, is used to define a rule to share the cost among the nodes (agents). We show that this rule coincides with the folk solution, a very well-known rule of this literature.minimum cost ...
Vidal-Puga, Juan, Bergantiños, Gustavo
core
Bioinspired Adaptive Sensors: A Review on Current Developments in Theory and Application
Advanced Materials, EarlyView.This review comprehensively summarizes the recent progress in the design and fabrication of sensory‐adaptation‐inspired devices and highlights their valuable applications in electronic skin, wearable electronics, and machine vision. The existing challenges and future directions are addressed in aspects such as device performance optimization ...
Guodong Gong +12 more
wiley +1 more source
Spanning trees for many different numbers of leaves [PDF]
Discrete Mathematics & Theoretical Computer ScienceLet $G$ be a connected graph and $L(G)$ the set of all integers $k$ such that $G$ contains a spanning tree with exactly $k$ leaves. We show that for a connected graph $G$, the set $L(G)$ is contiguous.
Kenta Noguchi, Carol T. Zamfirescu
doaj +1 more source
No advantageous merging in minimum cost spanning tree problems [PDF]
In the context of cost sharing in minimum cost spanning tree problems, we introduce a property called No Advantageous Merging. This property implies that no group of agents can be better off claiming to be a single node.
Vidal-Puga, Juan, Gomez-Rua, Maria
core
Advanced Materials, EarlyView.Metal‐free carbon catalysts enable the sustainable synthesis of hydrogen peroxide via two‐electron oxygen reduction; however, active site complexity continues to hinder reliable interpretation. This review critiques correlation‐based approaches and highlights the importance of orthogonal experimental designs, standardized catalyst passports ...
Dayu Zhu +3 more
wiley +1 more source