Results 91 to 100 of about 2,699,353 (198)

Linearly Representable Submodular Functions: An Algebraic Algorithm for Minimization [PDF]

open access: yes, 2020
A set function f : 2^E → ℝ on the subsets of a set E is called submodular if it satisfies a natural diminishing returns property: for any S ⊆ E and x,y ∉ S, we have f(S ∪ {x,y}) - f(S ∪ {y}) ≤ f(S ∪ {x}) - f(S).
Rathi, Rajat, Gurjar, Rohit
core   +1 more source

Game‐Theoretic Multi‐Agent Dynamic Traffic Assignment Using Congestion‐Aware Adaptive Learning

open access: yesIET Intelligent Transport Systems, Volume 20, Issue 1, January/December 2026.
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

Constrained Submodular Maximization via New Bounds for DR-Submodular Functions [PDF]

open access: yes, 2023
Submodular maximization under various constraints is a fundamental problem studied continuously, in both computer science and operations research, since the late $1970$'s.
Buchbinder, Niv, Feldman, Moran
core   +1 more source

Submodular Functions and Perfect Graphs

open access: yesMathematics of Operations Research
We give a combinatorial polynomial-time algorithm to find a maximum weight independent set in perfect graphs of bounded degree that do not contain a prism or a hole of length four as an induced subgraph. An even pair in a graph is a pair of vertices all induced paths between which are even.
Tara Abrishami   +3 more
openaire   +4 more sources

Reinforcement Learning–Enhanced Influence Maximisation via Credibility‐Based Clustering and Metaheuristic Optimisation

open access: yesIET Networks, Volume 15, Issue 1, January/December 2026.
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

Low-Delay and High-Coverage Water Distribution Networks Monitoring Using Mobile Sensors

open access: yesIEEE Access, 2019
Urban water distribution networks (WDNs) are usually threatened by leakage, reflux, infiltration and internal pollution. To ensure the safety of water supply, it is essential to properly monitor the WDNs.
Junbin Liang   +3 more
doaj   +1 more source

Ranking with submodular functions on the fly

open access: yes, 2023
Maximizing submodular functions have been studied extensively for a wide range of subset-selection problems. However, much less attention has been given to the role of submodularity in sequence-selection and ranking problems. A recently-introduced framework, named \emph{maximum submodular ranking} (MSR), tackles a family of ranking problems that arise ...
Guangyi Zhang 0001   +2 more
openaire   +4 more sources

A Two‐Level Hierarchical Sparse DRL Framework for Coordinated Wide‐Area and Local Damping in DFIG‐Rich Low‐Inertia Grids

open access: yesIET Renewable Power Generation, Volume 20, Issue 1, January/December 2026.
ABSTRACT This paper presents a two‐level hierarchical adaptive damping control strategy designed to robustly mitigate inter‐area low‐frequency oscillations (LFOs) in large‐scale power systems featuring high shares of doubly‐fed induction generator (DFIG) wind farms. The proposed structure integrates a central wide‐area damping controller (WADC), driven
Mohsen Darabian   +4 more
wiley   +1 more source

Data Correcting Algorithms in Combinatorial Optimization [PDF]

open access: yes
This paper describes data correcting algorithms. It provides the theory behind the algorithms and presents the implementation details and computational experience with these algorithms on the asymmetric traveling salesperson problem, the problem of ...
Goldengorin, Boris   +2 more
core  

Efficient Minimization of Decomposable Submodular Functions [PDF]

open access: yes, 2010
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of convex functions, and can be minimized in strongly polynomial time ...
Krause, Andreas, Stobbe, Peter
core  

Home - About - Disclaimer - Privacy