Results 321 to 330 of about 7,815,504 (353)
Some of the next articles are maybe not open access.
Dynamic matching pennies on networks
International Journal of Game Theory, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhigang Cao 0002 +3 more
openaire +2 more sources
The feasibility of matchings in a wireless network
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004The problem of determining what links can be simultaneously activated in a wireless network such that a signal-to-interference-and-noise (SINR) constraint is satisfied at all receivers is considered. The term "feasible matching" is introduced to describe a set of (transmitter, receiver) pairs for which there exists some set of transmit powers which can
Steven A. Borbash, Anthony Ephremides
openaire +1 more source
2008
Let $\mathcal{N}$ and $\mathcal{M}$ be two road networks represented in vector form and covering rectangular areas Rand R?, respectively, not necessarily parallel to each other, but with R? ? R. We assume that $\mathcal{N}$ and $\mathcal{M}$ use different coordinate systems at (possibly) different, but known scales.
Yago Diez +2 more
openaire +1 more source
Let $\mathcal{N}$ and $\mathcal{M}$ be two road networks represented in vector form and covering rectangular areas Rand R?, respectively, not necessarily parallel to each other, but with R? ? R. We assume that $\mathcal{N}$ and $\mathcal{M}$ use different coordinate systems at (possibly) different, but known scales.
Yago Diez +2 more
openaire +1 more source
Journal of the experimental analysis of behavior, 2010
Pigeons were given practice choosing between pairs of alternatives yielding different frequencies of reinforcement. Four individual alternatives were set into four pairwise choices. Averaged over subjects, the distribution of responses in each choice approximated matching.
R J, Herrnstein, D H, Loveland
openaire +1 more source
Pigeons were given practice choosing between pairs of alternatives yielding different frequencies of reinforcement. Four individual alternatives were set into four pairwise choices. Averaged over subjects, the distribution of responses in each choice approximated matching.
R J, Herrnstein, D H, Loveland
openaire +1 more source
Spectral-invariant matching network
Information Fusion, 2022YeongMin Ko +4 more
openaire +1 more source
Determination of the Impedance Matching Domain of Impedance Matching Networks
IEEE Transactions on Circuits and Systems I: Regular Papers, 2004This paper investigates the impedance boundary of impedance matching networks analytically, graphically representing the resultant impedance matching domains. A set of explicit equations is derived to allow the rapid development of the impedance boundary of such networks.
Mark Thompson 0005, J. Kel Fidler
openaire +1 more source
Stable Matching in Structured Networks
2016Stable matching studies how to pair members of two sets with the objective to achieve a matching that satisfies all participating agents based on their preferences. In this research, we consider the case of matching in a social network where agents are not fully connected.
Ying Ling, Tao Wan 0001, Zengchang Qin
openaire +1 more source
Research and application of matching network
Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence, 2022Chao Jiang, Junyang Mo, Zhongming Pan
openaire +1 more source
String Matching Artificial Neural Networks
International Journal of Neural Systems, 2001Three artificial neural networks (ANNs) are proposed for solving a variety of on- and off-line string matching problems. The ANN structure employed as the building block of these ANNs is derived from the harmony theory (HT) ANN, whereby the resulting string matching ANNs are characterized by fast match-mismatch decisions, low computational complexity,
openaire +2 more sources
Approximate Matching of Network Expressions with Spacers
Journal of Computational Biology, 1996Two algorithmic results are presented that are pertinent to the matching of patterns typically used by biologists to describe regions of macromolecular sequences that encode a given function. The first result is a threshold-sensitive algorithm for approximately matching both network and regular expressions.
openaire +2 more sources