Results 31 to 40 of about 7,398,457 (268)

An Equitable Solution to the Stable Marriage Problem [PDF]

open access: yes2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI), 2015
A stable marriage problem (SMP) of size n involves n men and n women, each of whom has ordered members of the opposite gender by descending preferability. A solution is a perfect matching among men and women, such that there exists no pair who prefer each other to their current spouses. The problem was formulated in 1962 by Gale and Shapley, who showed
Ioannis Giannakopoulos   +4 more
openaire   +1 more source

Instability in Stable Marriage Problem: Matching Unequally Numbered Men and Women

open access: yesComplexity, 2018
The goal of the stable marriage problem is to match by pair two sets composed by the same number of elements. Due to its widespread applications in the real world, especially the unique importance to the centralized matchmaker, a very large number of ...
Gui-Yuan Shi   +4 more
doaj   +1 more source

Analogies in Yakut Olonkho and Tuvan Epos: Plot-Compositional Structure, Motives (based on the Epics “Nyurgun Bootur the Swift” by G. K. Orosin and “Hunan-Kara” Changchi-Khoo Oorzhak)

open access: yesНаучный диалог, 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

Efficient algorithms for generalized Stable Marriage and Roommates problems [PDF]

open access: yes, 2007
We consider a generalization of the Stable Roommates problem (SR), in which preference lists may be partially ordered and forbidden pairs may be present, denoted by SRPF.
Irving, R.W.   +5 more
core   +1 more source

An 8/5 approximation algorithm for a hard variant of stable marriage [PDF]

open access: yes, 2007
When ties and incomplete preference lists are permitted in the Stable Marriage problem, stable matchings can have different sizes. The problem of finding a maximum cardinality stable matching in this context is NP-hard, even under very severe ...
Irving, R.W.   +3 more
core   +1 more source

Matching theory for cognitive radio networks: An overview

open access: yesICT 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

The relationship between cognitive schemas activated in sexual context and early maladaptive schemas among married women of childbearing age

open access: yesBMC 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

Stable marriage with ties and bounded length preference lists [PDF]

open access: yes, 2009
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practical applications, such as centralised matching schemes that assign ...
Irving, R.W.   +5 more
core   +1 more source

Intelligent UAV Deployment for a Disaster-Resilient Wireless Network

open access: yesSensors, 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

Home - About - Disclaimer - Privacy