Results 41 to 50 of about 12,042 (183)
An algorithm for a super-stable roommates problem [PDF]
, 2011 In this paper, we describe an efficient algorithm that decides if a stable matching exists for a generalized stable roommates problem, where, instead of linear preferences, agents have partial preference orders on potential partners.
Irving, R.W. +8 more
core +1 more source
Научный диалог, 2020 The results of a comparative analysis of the texts of the Yakut and Tuvan epics in order to establish common features in the epic heritage of the Yakut and Tuvan peoples are presented in the article.
A. F. Koryakina
doaj +1 more source
"Almost stable" matchings in the Roommates problem [PDF]
, 2006 An instance of the classical Stable Roommates problem (SR) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, i.e. admits the fewest number of blocking pairs. In this paper we prove that,
David J. Abraham +5 more
core +1 more source
Matching theory for cognitive radio networks: An overview
ICT Express, 2019 Cognitive radio networks have recently emerged as a novel and efficient technology to confront the scarcity of spectrum bands. While discussing the spectrum sharing and resource management in cognitive radio networks, many recent research works address ...
Sayantan Chowdhury
doaj +1 more source
Stable marriages and search frictions [PDF]
, 2014 Stable matchings are the primary solution concept for two-sided matching markets with nontransferable utility. We investigate the strategic foundations of stability in a decentralized matching market.
Nöldeke, Georg, Lauermann, Stephan
core +1 more source
BMC Psychology, 2022 Background Healthy sex can be affected by cognitive schemas activated in the sexual context (CSASCs) and early maladaptive schemas (EMSs). Cognitive schemas are the nuclear structure of the cognitive system which facilitate the interaction between ...
Zainab Alimoradi +5 more
doaj +1 more source
"Almost stable" matchings in the roommates problem with bounded preference lists [PDF]
, 2012 An instance of the classical Stable Roommates problem need not admit a stable matching. Previous work has considered the problem of finding a matching that is “as stable as possible”, i.e., admits the minimum number of blocking pairs.
Biró, Péter +7 more
core +1 more source
Intelligent UAV Deployment for a Disaster-Resilient Wireless Network
Sensors, 2020 Deployment of unmanned aerial vehicles (UAVs) as aerial base stations (ABSs) has been considered to be a feasible solution to provide network coverage in scenarios where the conventional terrestrial network is overloaded or inaccessible due to an ...
Hassaan Hydher +3 more
doaj +1 more source
Popular matchings in the marriage and roommates problems [PDF]
, 2010 Popular matchings have recently been a subject of study in the context of the so-called House Allocation Problem, where the objective is to match applicants to houses over which the applicants have preferences.
Biró, P. +5 more
core +1 more source
Interference Management in Full-Duplex Cellular Networks With Partial Spectrum Overlap
IEEE Access, 2017 Full-duplex (FD) communication is promoted to double the spectral efficiency when compared with the half-duplex counterpart. In the context of cellular networks, however, FD communication exacerbates the aggregate uplink (UL) and downlink (DL ...
Itsikiantsoa Randrianantenaina +3 more
doaj +1 more source