Results 71 to 80 of about 13,203 (237)
ABSTRACT Networked control systems (NCSs) often suffer from performance degradation due to limited communication bandwidth, which can cause data transmission conflicts and packet loss. Existing scheduling strategies may fail to simultaneously meet the real‐time requirements and the importance of multisensor data, and they are particularly vulnerable ...
Da Chen +5 more
wiley +1 more source
Approximating Submodular Functions Everywhere [PDF]
URL to paper from conference site ; Submodular functions are a key concept in combinatorial optimization. Algorithms that involve submodular functions usually assume that they are given by a (value) oracle. Many interesting problems involving submodular functions can be solved using only polynomially many queries to the oracle, e.g., exact minimization
Goemans, Michel X. +3 more
openaire +1 more source
Maximization of Approximately Submodular Functions
12 ...
Thibaut Horel, Yaron Singer
openaire +3 more sources
Optimal Selling Mechanisms With Endogenous Seller Outside Offers
ABSTRACT We examine a two‐stage selling mechanism design problem, where the buyer makes her report and the seller endogenously decides his effort (hidden investment) to generate a possibly better outside offer. The optimal mechanism shows that the seller's effort depends on the reported value of the buyer; a higher value lowers the seller's incentive ...
Xiaogang Che +3 more
wiley +1 more source
Resilient Monotone Submodular Function Maximization
In this paper, we focus on applications in machine learning, optimization, and control that call for the resilient selection of a few elements, e.g. features, sensors, or leaders, against a number of adversarial denial-of-service attacks or failures.
Gatsis, Konstantinos +3 more
core +1 more source
Polymatroidal tilings and the Chow class of linked projective spaces
Abstract Linked projective spaces are quiver Grassmannians of constant dimension one of certain quiver representations, called linked nets, over certain quivers, called Zn$\mathbb {Z}^n$‐quivers. They were recently introduced as a tool for describing schematic limits of families of divisors.
Felipe de Leon, Eduardo Esteves
wiley +1 more source
Decomposable Submodular Function Minimization via Maximum Flow [PDF]
Kyriakos Axiotis +4 more
openalex +1 more source
Coreness of Cooperative Games with Truncated Submodular Profit Functions
Coreness represents solution concepts related to core in cooperative games, which captures the stability of players. Motivated by the scale effect in social networks, economics and other scenario, we study the coreness of cooperative game with truncated ...
AC Bemmaor +8 more
core +1 more source
A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs
ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie +5 more
wiley +1 more source
On Constructing Finite, Finitely Subadditive Outer Measures, and Submodularity
Given a nonempty abstract set 𝑋, and a covering class 𝒞, and a finite, finitely subadditive outer measure 𝜈, we construct an outer measure 𝜈 and investigate conditions for 𝜈 to be submodular. We then consider several other set functions associated with 𝜈
Charles Traina
doaj +1 more source

