Results 41 to 50 of about 303,366 (308)
An 8/5 approximation algorithm for a hard variant of stable marriage [PDF]
, 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., Manlove, D.F.
core +1 more source
The stable marriage problem with restricted pairs
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dias, Vânia M.F. +3 more
openaire +2 more sources
Approximability results for stable marriage problems with ties [PDF]
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Halldorsson, M. +6 more
openaire +2 more sources
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
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
Popular Matchings in the Stable Marriage Problem
Information and Computation, 2011 We consider the problem of computing a maximum cardinality popular matching in a bipartite graph G=(A@?B,E) where each vertex u@?A@?B ranks its neighbors in a strict order of preference. Such a graph is called an instance of the stable marriage problem with strict preferences and incomplete lists. A matching M^@? is popular if for every matching M in G,
Huang, Chien-Chung, Kavitha, Telikepalli
openaire +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
New and simple algorithms for stable flow problems [PDF]
, 2018 Stable flows generalize the well-known concept of stable matchings to markets in which transactions may involve several agents, forwarding flow from one to another.
A-T Gai +24 more
core +2 more sources
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
Discrete Competitive Lotka–Volterra Model with Controllable Phase Volume
Systems, 2020 The simulation of population dynamics and social processes is of great interest in nonlinear systems. Recently, many scholars have paid attention to the possible applications of population dynamics models, such as the competitive Lotka–Volterra equation,
Anzhelika Voroshilova, Jeff Wafubwa
doaj +1 more source