Results 11 to 20 of about 1,433,317 (315)
Theoretical Computer Science, 2021 In 2005, Goddard, Hedetniemi, Hedetniemi and Laskar [Generalized subgraph-restricted matchings in graphs, Discrete Mathematics, 293 (2005) 129 - 138] asked the computational complexity of determining the maximum cardinality of a matching whose vertex set induces a disconnected graph. In this paper we answer this question.
Guilherme de C. M. Gomes +4 more
openaire +4 more sources
, 2011 This article introduces the quantitative analysis of choice behavior by describing a number of equations developed over the years to describe the relation between the allocation of behavior under concurrent schedules of reinforcement and the consequences
Timothy L. Edwards +7 more
core +1 more source
SIAM Journal on Computing, 2007 We consider the problem of matching a set of applicants to a set of posts, where each applicant has a preference list, ranking a non-empty subset of posts in order of preference, possibly involving ties. We say that a matching M is popular if there is no matching M' such that the number of applicants preferring M' to M exceeds the number of applicants ...
Abraham, David J +3 more
openaire +5 more sources
Property Matching and Weighted Matching
Theoretical Computer Science, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amir, A +4 more
openaire +4 more sources
A memetic fingerprint matching algorithm [PDF]
, 2007 Minutiae point pattern matching is the most common approach for fingerprint verification. Although many minutiae point pattern matching algorithms have been proposed, reliable automatic fingerprint verification remains as a challenging problem, both with
Howells, Gareth +3 more
core +1 more source
On perfect matchings in matching covered graphs [PDF]
Journal of Graph Theory, 2018 AbstractA graph is matching‐covered if every edge of is contained in a perfect matching. A matching‐covered graph is strongly coverable if, for any edge of , the subgraph is still matching‐covered. An edge subset of a matching‐covered graph is feasible if there exist two perfect matchings and such that , and an edge subset with at least two ...
Jinghua He +3 more
openaire +3 more sources
Games, 2021 We introduce a new class of matching mechanisms—quantile stable mechanisms—that generate stable matchings that can be seen as a compromise between sides of a two-sided market.
Peter Chen +3 more
doaj +1 more source
Theoretical Computer Science, 2020 A link stream is a sequence of pairs of the form $(t,\{u,v\})$, where $t\in\mathbb N$ represents a time instant and $u\neq v$. Given an integer $γ$, the $γ$-edge between vertices $u$ and $v$, starting at time $t$, is the set of temporally consecutive edges defined by $\{(t',\{u,v\}) | t' \in [t,t+γ-1]\}$. We introduce the notion of temporal matching of
Baste, Julien +2 more
openaire +6 more sources
Matching a Distribution by Matching Quantiles Estimation [PDF]
Journal of the American Statistical Association, 2015 Motivated by the problem of selecting representative portfolios for backtesting counterparty credit risks, we propose a matching quantiles estimation (MQE) method for matching a target distribution by that of a linear combination of a set of random variables.
Nikolaos Sgouropoulos +2 more
openaire +3 more sources
South African Journal of Communication Disorders, 2013 Background: Tinnitus is one of the otologic symptoms commonly reported to be associated with temporomandibular disorder (TMD), and questions regarding its nature and cause continue to plague the clinical and research community.
Amisha Kanji, Katijah Khoza-Shangase
doaj +1 more source