Results 141 to 150 of about 121,460 (194)
Improving Multivariate Time-Series Anomaly Detection in Industrial Sensor Networks Using Entropy-Based Feature Aggregation. [PDF]
Entropy (Basel)Wang B.
europepmc +1 more source
Consensus Control of Saturated Multi-Agent Systems with Heterogeneous Asymmetric Saturation Constraints Under Flexible Topologies. [PDF]
Sensors (Basel)Wang Z, Yang J, Yang H, Jin Z.
europepmc +1 more source
Tracking Consensus for Nonlinear Multi-Agent Systems Under Asynchronous Switching and Undirected Topology. [PDF]
Sensors (Basel)Hu S, Wang M.
europepmc +1 more source
Safe formation scaling and motion planning for heterogeneous UAV-UGV teams in cluttered environments. [PDF]
Sci RepChen Q, Liu X, Nie W, Liu H, Pang W.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Cybernetics and Systems Analysis, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sharifov, F., Hulianytskyi, L.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sharifov, F., Hulianytskyi, L.
openaire +3 more sources
Exploring Unknown Undirected Graphs
Journal of Algorithms, 1999Let \(G= (V, E)\) be an undirected connected graph. A robot explores all nodes and edges of \(G\) and makes a complete map. It starts from some node without any a priori knowledge of \(G\). The penalty of an exploration algorithm is the worst case number of transversals of already explored edges. The authors give an algorithm whose penalty is \(O(|V|)\)
Panaite, Petrişor, Pelc, Andrzej
openaire +2 more sources
Canadian Journal of Mathematics, 1966
By an undirected graph we mean a couple (X, R), where X is a set and R is a subset of X × X such that (x, y) ∈ R implies (y, x) ∈ R. The cardinal of X, denoted by |X|, will be called the cardinal of the graph.A mapping f:X → X is called an endomorphism of (X, R) if (x, y) ∈ R implies that (f(x), f(y)) ∈ R for all x, y ∈ R.An undirected graph (X, R) is ...
Hedrlin, Z., Pultr, A.
openaire +2 more sources
By an undirected graph we mean a couple (X, R), where X is a set and R is a subset of X × X such that (x, y) ∈ R implies (y, x) ∈ R. The cardinal of X, denoted by |X|, will be called the cardinal of the graph.A mapping f:X → X is called an endomorphism of (X, R) if (x, y) ∈ R implies that (f(x), f(y)) ∈ R for all x, y ∈ R.An undirected graph (X, R) is ...
Hedrlin, Z., Pultr, A.
openaire +2 more sources
Packing cycles in undirected graphs
Journal of Algorithms, 2003Summary: Given an undirected graph \(G\) with \(n\) nodes and \(m\) edges, we address the problem of finding a largest collection of edge-disjoint cycles in \(G\). The problem, dubbed cycle packing, is very closely related to a few genome rearrangement problems in computational biology.
Caprara A., Panconesi A., RIZZI, ROMEO
openaire +3 more sources