نتایج جستجو برای: uncertain graph
تعداد نتایج: 258184 فیلتر نتایج به سال:
let $r$ be a ring with unity. the undirected nilpotent graph of $r$, denoted by $gamma_n(r)$, is a graph with vertex set ~$z_n(r)^* = {0neq x in r | xy in n(r) for some y in r^*}$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy in n(r)$, or equivalently, $yx in n(r)$, where $n(r)$ denoted the nilpotent elements of $r$. recently, it has been proved that if $r$ is a left ar...
In this paper we address the problem of uncertainty management for robust design, and verification of large dynamic networks whose performance is affected by an equally large number of uncertain parameters. Many such networks (e.g. power, thermal and communication networks) are often composed of weakly interacting subnetworks. We propose intrusive and non-intrusive iterative schemes that exploi...
Standard algorithms for finding the short est path in a graph require that the cost of a path be additive in edge costs, and typically assume that costs are determinis tic. We consider the problem of uncertain edge costs, with potential probabilistic de pendencies among the costs. Although these dependencies violate the standard dynamic programming decomposition, we identify a weaker stocha...
Temporal representation and reasoning has been applied so far to many areas of AI, including medical applications. Identification of temporal patterns plays an important role in medical diagnostics. Temporal scenarios of different diseases, therapy protocols, and other temporal graphs provide important additional information for medical decisions. In this paper we propose an application of alge...
Different uses of a road network call for the consideration of different travel costs: in route planning, travel time and distance are typically considered, and green house gas (GHG) emissions are increasingly being considered. Further, costs such as travel time and GHG emissions are time-dependent and uncertain. To support such uses, we propose techniques that enable the construction of a mult...
In this paper, a group consensus problem is investigated for the heterogeneous agents that are governed by the Euler–Lagrange system and the double-integrator system, respectively, and the parameters of the Euler–Lagrange system are uncertain. To achieve group consensus, a novel group consensus protocol and a time-varying estimator of the uncertain parameters are proposed. By combining algebrai...
Standard algorithms for nding the shortest path in a graph require that the cost of a path be additive in edge costs, and typically assume that costs are determinis-tic. We consider the problem of uncertain edge costs, with potential probabilistic dependencies among the costs. Although these dependencies violate the standard dynamic-programming decomposition, we identify a weaker stochastic con...
given a non-abelian finite group $g$, let $pi(g)$ denote the set of prime divisors of the order of $g$ and denote by $z(g)$ the center of $g$. thetextit{ prime graph} of $g$ is the graph with vertex set $pi(g)$ where two distinct primes $p$ and $q$ are joined by an edge if and only if $g$ contains an element of order $pq$ and the textit{non-commuting graph} of $g$ is the graph with the vertex s...
This paper considers the cooperative output regulation problem for linear multi-agent systems with a directed communication graph, heterogeneous linear subsystems, and an exosystem whose output is available to only a subset of subsystems. Both the cases with nominal and uncertain linear subsystems are studied. For the case with nominal linear subsystems, a distributed adaptive observer-based co...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید