Results 311 to 320 of about 8,016,307 (335)

The fault‐tolerant beacon set of hexagonal Möbius ladder network

Mathematical methods in the applied sciences, 2023
In localization, some specific nodes (beacon set) are selected to locate all nodes of a network, and if an arbitrary node stops working and still selected nodes remain in the beacon set, then the chosen nodes are called fault‐tolerant beacon set.
M. Faisal Nadeem, Muhammad Azeem
semanticscholar   +1 more source

Resolving Conflict in the Home Care Setting

Home Healthcare Nurse: The Journal for the Home Care and Hospice Professional, 2008
Conflict occurs when the needs of 2 or more people are incongruent and not being met simultaneously. Thomas defines conflict as “the process that begins when one party perceives that the other party has negatively affected, or is about to negatively affect, something he or she cares about” (cited ...
Rebecca, Askew, P Renée, Williams, Marcia, Rachel, Olivia, Martin   +3 more
openaire   +2 more sources

Resolving Resistances to Immediacy in the Group Setting

International Journal of Group Psychotherapy, 1993
This article presents interventions appropriate to three forms of resistance commonly encountered in the group. One is the tendency of members to talk in the past tense instead of the present. A second is the disposition of members to dwell on the future. The third is their tendency to occupy the group with issues in their outside lives. Also mentioned
openaire   +2 more sources

Resolving-power dominating sets

Applied Mathematics and Computation, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stephen, Sudeep, Rajan, Bharati, Grigorious, Cyriac, William, Albert   +3 more
openaire   +3 more sources

Spider‐specific probe set for ultraconserved elements offers new perspectives on the evolutionary history of spiders (Arachnida, Araneae)

Molecular Ecology Resources, 2020
Phylogenomic methods have proven useful for resolving deep nodes and recalcitrant groups in the spider tree of life. Across arachnids, transcriptomic approaches may generate thousands of loci, and target‐capture methods, using the previously designed ...
Siddharth Kulkarni, Hannah M. Wood, Michael W. Lloyd, G. Hormiga   +3 more
semanticscholar   +1 more source

Resolving Indeterminacy in Dynamic Settings: The Role of Shocks*

Quarterly Journal of Economics, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frankel, David, Pauzner, Ady
openaire   +2 more sources

Metric Dimension and Geodetic Set Parameterized by Vertex Cover

Symposium on Theoretical Aspects of Computer Science
For a graph $G$, a subset $S\subseteq V(G)$ is called a resolving set of $G$ if, for any two vertices $u,v\in V(G)$, there exists a vertex $w\in S$ such that $d(w,u)\neq d(w,v)$. The Metric Dimension problem takes as input a graph $G$ on $n$ vertices and
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, P. Tale   +6 more
semanticscholar   +1 more source

Hermitian Geometry on Resolvent Set

2018
For a tuple \({A} = ({A}_{1}, {A}_{2}, \ldots, {A}_{n})\) of elements in a unital Banach algebra \(\mathcal{B}\), its projective joint spectrum P(A) is the collection of \({z} \in {\mathbb{C}}^{n}\) such that \({A}(z) = {z}_{1}{A}_{1} + {z}_{2}{A}_{2} + \cdots + {z}_{n}{A}_{n}\) is not invertible.
Ronald G. Douglas, Rongwei Yang
openaire   +1 more source

On large sets of resolvable and almost resolvable oriented triple systems

Journal of Combinatorial Designs, 1996
Summary: An \(\text{MTS} (v)\) [or \(\text{DTS} (v)]\) is said to be resolvable, denoted by \(\text{RMTS} (v)\) [or \(\text{RDTS} (v)]\), if its block set can be partitioned into parallel classes. An \(\text{MTS} (v)\) [or \(\text{DTS} (v)]\) is said to be almost resolvable, denoted by \(\text{ARMTS} (v)\) [or \(\text{ARDTS} (v)]\), if its block set ...
Kang, Qingde, Lei, Jianguo
openaire   +2 more sources

Maker–Breaker Resolving Game

Bulletin of the Malaysian Mathematical Sciences Society, 2020
A set of vertices W of a graph G is a resolving set if every vertex of G is uniquely determined by its vector of distances to W. In this paper, the Maker–Breaker resolving game is introduced.
Cong X. Kang, S. Klavžar, I. G. Yero, Eunjeong Yi   +3 more
semanticscholar   +1 more source