Results 41 to 50 of about 3,335 (132)
Advanced Intelligent Systems, Volume 6, Issue 9, September 2024.Advancing global path planning algorithm is studied for transforming geochemical mining sampling in autonomous vehicles. Cutting‐edge algorithms are harnessed to solve the intricate traveling salesman problem, optimizing route efficiency. A novel analysis of operations research‐tools and reinforcement learning techniques is investigated, demonstrating ...
Alexandre Benoit, Pedram Asef
wiley +1 more source
An adaptive neural design for planar rigid formation of three coleaders in unknown flowfields
IET Control Theory &Applications, Volume 18, Issue 6, Page 814-824, April 2024.This article deals with the robust planar rigid formation control problem of three second‐order coleaders with unknown flowfields acting on the velocity and acceleration respectively. To yield the uniform boundedness property of the resulting system, an adaptive projection is introduced to design the novel adaptive neural control law.
Weibin Chen, Peng Xu, Yang‐Yang Chen
wiley +1 more source
Properties of Catlin's reduced graphs and supereulerian graphs [PDF]
, 2015 A graph $G$ is called collapsible if for every even subset $R\subseteq V(G)$, there is a spanning connected subgraph $H$ of $G$ such that $R$ is the set of vertices of odd degree in $H$.
Chen, Wei-Guo, Chen, Zhi-Hong, Lu, Mei
core +2 more sources
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
, 2006 In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cannot consider only one particular solution as the optimal solution. Instead,
Manthey, Bodo, Ram, L. Shankar
core +4 more sources
Indoor Air, Volume 2024, Issue 1, 2024.Nowadays, dust exposure pollution is receiving a lot of attention due to its significant impact on public health. To investigate the impact of dust particle size and human respiratory strength on respiratory particle deposition patterns, data was collected through on‐site surveys. The study analyzed the equivalent respiratory strength, dust environment
Gang Zhou +8 more
wiley +1 more source
On the digraph of a unitary matrix
, 2003 Given a matrix M of size n, a digraph D on n vertices is said to be the digraph of M, when M_{ij} is different from 0 if and only if (v_{i},v_{j}) is an arc of D.
Grössing Gerhard +5 more
core +2 more sources
Maximum Scatter TSP in Doubling Metrics
, 2016 We study the problem of finding a tour of $n$ points in which every edge is long. More precisely, we wish to find a tour that visits every point exactly once, maximizing the length of the shortest edge in the tour. The problem is known as Maximum Scatter
Kozma, László, Mömke, Tobias
core +1 more source
On stability of the Hamiltonian index under contractions and closures [PDF]
, 2002 The hamiltonian index of a graph $G$ is the smallest integer $k$ such that the $k$-th iterated line graph of $G$ is hamiltonian. We first show that, with one exceptional case, adding an edge to a graph cannot increase its hamiltonian index.
Broersma, H.J., Ryjáček, Z., Xiong, L.
core +3 more sources
Decomposing 8-regular graphs into paths of length 4
, 2016 A $T$-decomposition of a graph $G$ is a set of edge-disjoint copies of $T$ in $G$ that cover the edge set of $G$. Graham and H\"aggkvist (1989) conjectured that any $2\ell$-regular graph $G$ admits a $T$-decomposition if $T$ is a tree with $\ell$ edges ...
Botler, Fábio, Talon, Alexandre
core +1 more source
Eulerian digraphs and toric Calabi-Yau varieties
, 2010 We investigate the structure of a simple class of affine toric Calabi-Yau varieties that are defined from quiver representations based on finite eulerian directed graphs (digraphs). The vanishing first Chern class of these varieties just follows from the
de Medeiros, Paul
core +1 more source