Results 81 to 90 of about 1,909,109 (209)
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
Scalable Submodular Policy Optimization via Pruned Submodularity Graph
16 ...
Aditi Anand +2 more
openaire +3 more sources
Assortative Matching on Income
We analyze marital matching on income using an extremely rich Dutch data set containing all income tax files over seven years. We develop a novel methodology that directly extends previous contributions to allow for highly flexible matching patterns. Investigating all marriages that took place between 2013 and 2019, we find that marital patterns are ...
Pierre‐André Chiappori +3 more
wiley +1 more source
An Approximation Algorithm for Risk-Averse Submodular Optimization [PDF]
Whole version for WAFR, 2018 final ...
Lifeng Zhou 0001, Pratap Tokekar
openaire +3 more sources
Online Submodular Maximization via Online Convex Optimization [PDF]
We study monotone submodular maximization under general matroid constraints in the online setting. We prove that online optimization of a large class of submodular functions, namely, threshold potential functions, reduces to online convex optimization ...
Ioannidis, Stratis +4 more
core +2 more sources
Online Weakly DR-Submodular Optimization Under Stochastic Cumulative Constraints
In this paper, we study a class of online continuous optimization problems. At each round, the utility function is the sum of a weakly diminishing-returns (DR) submodular function and a concave function, certain cost associated with the action will occur,
Junkai Feng +3 more
doaj +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
Same/Other/All K‐Fold Cross‐Validation for Estimating Similarity of Patterns in Data Subsets
ABSTRACT In many real‐world applications of machine learning, we are interested to know if it is possible to train on the data that we have gathered so far, and obtain accurate predictions on a new test data subset that is qualitatively different in some respect (time period, geographic region, etc.).
Toby Dylan Hocking +5 more
wiley +1 more source
Game‐Theoretic Multi‐Agent Dynamic Traffic Assignment Using Congestion‐Aware Adaptive Learning
This paper proposes a novel game‐theoretic multi‐agent framework for dynamic traffic assignment problems, integrating congestion‐aware adaptive learning to simultaneously reduce individual travel time and improve overall network efficiency under dynamic congestion.
Dandan Wu +4 more
wiley +1 more source
In this study, a novel approach of integrating artificial intelligence (AI) and machine learning, that is, reinforcement learning (RL), with centrality measures is introduced to improve information spreading in social networks. RL models the decision process to dynamically select powerful nodes that bypass static measures of centrality constraints ...
Mohammad Mehdi Karimi +3 more
wiley +1 more source

