Results 111 to 120 of about 963,583 (273)
Network Selection Algorithm Based on Stable Matching Game in Vehicular Heterogeneous Network
A gaming method of vehicular heterogeneous network selection was proposed, to solve the network access problem of vehicles in heterogeneous network coverage.
Rui Zhang, Jing Hu, Weiwei Xia
doaj +2 more sources
The Stable Matching Problem in TBEV Enzootic Circulation: How Important Is the Perfect Tick-Virus Match? [PDF]
Liebig K +8 more
europepmc +1 more source
Ordinally Bayesian Incentive Compatible Stable Matchings [PDF]
We study incentive issues related to two-sided one-to-one stable matching problem after weakening the notion of strategy-proofness to Ordinal Bayesian Incentive Compatibility (OBIC).
Dipjyoti Majumdar
core
In mathematics, economics, and computer science, the stable marriage problem (also stable matching problem or SMP) is the problem of finding a stable matching between two equally sized sets of elements given an ordering of preferences for each element. A matching is a bijection from the elements of one set to the elements of the other set.
openaire +1 more source
Effect of chemotherapy on passenger mutations in metastatic colorectal cancer
Changes in passenger mutation load and predicted immunotherapy response after chemotherapy treatment. Tumor cells rich with passenger mutations have increased sensitivity to chemotherapy. Correlation of passenger mutations with neoantigen load suggests highly mutated clones promote a more effective response to immunotherapy, and therefore, first‐line ...
Marium T. Siddiqui +6 more
wiley +1 more source
Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists
In the stable marriage problem, any instance admits the so-called man-optimal stable matching, in which every man is assigned the best possible partner.
Shuichi Miyazaki +4 more
doaj +1 more source
Paths to Stability for Matching Markets with Couples [PDF]
We study two-sided matching markets with couples and show that for a natural preference domain for couples, the domain of weakly responsive preferences, stable outcomes can always be reached by means of decentralized decision making.
Bettina Klaus, Flip Klijn
core
The weighted stable matching problem [PDF]
We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight.
Farczadi, Linda, Guričanová, Natália
core +1 more source
Generation of two normal and tumour (cancerous) paired human cell lines using an established tissue culture technique and their characterisation is described. Cell lines were characterised at cellular, protein, chromosome and gene expression levels and for HPV status.
Simon Broad +12 more
wiley +1 more source

