Results 71 to 80 of about 517 (178)

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

On the Supremum of Singleton Ratios in Submodular Functions

open access: yesMathematics
Let N be a finite set of cardinality n, and let a∈N. A submodular function f on N with f(a)=1 is defined to be a-reduced if, for any decomposition f=g+h into submodular functions, where h does not depend on a, it follows that h is identically zero.
Laszlo Csirmaz
doaj   +1 more source

Competitive Influence Maximization within Time and Budget Constraints in Online Social Networks: An Algorithmic Approach

open access: yesApplied Sciences, 2019
Competitive Influence Maximization ( CIM ) problem, which seeks a seed set nodes of a player or a company to propagate their product’s information while at the same time their competitors are conducting similar strategies, has been paid much ...
Canh V. Pham   +3 more
doaj   +1 more source

Multi-Topic Misinformation Blocking With Budget Constraint on Online Social Networks

open access: yesIEEE Access, 2020
Along with the development of Information Technology, Online Social Networks (OSN) are constantly developing and have become popular media in the world.
Dung V. Pham   +4 more
doaj   +1 more source

Hypergraph cuts with edge-dependent vertex weights

open access: yesApplied Network Science, 2022
We develop a framework for incorporating edge-dependent vertex weights (EDVWs) into the hypergraph minimum s-t cut problem. These weights are able to reflect different importance of vertices within a hyperedge, thus leading to better characterized cut ...
Yu Zhu, Santiago Segarra
doaj   +1 more source

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

Polarity related influence maximization in signed social networks. [PDF]

open access: yesPLoS ONE, 2014
Influence maximization in social networks has been widely studied motivated by applications like spread of ideas or innovations in a network and viral marketing of products.
Dong Li   +5 more
doaj   +1 more source

Optimizing Electric Vehicle Charging Infrastructure on Highways: A MILP Model for Balanced Demand Allocation

open access: yesInternational Journal of Energy Research, Volume 2026, Issue 1, 2026.
The strategic placement and sizing of electric vehicle (EV) charging stations on highways are critical for alleviating range anxiety and fostering widespread EV adoption. This paper presents a novel mixed‐integer linear programming (MILP) model for optimizing the location and capacity of charging stations along highway corridors.
Raka Jovanovic   +3 more
wiley   +1 more source

A T2T-Based Offloading Method: Virtual Bank With Movement Prediction

open access: yesIEEE Access, 2018
Rapid developments in network technologies and mobile devices improve our lives, but the resultant fast-growing traffic leads to a lack of cellular network resources and breaks the balance between profit and costs for network providers.
Lifeng Mai   +3 more
doaj   +1 more source

On Some Algorithmic and Structural Results on Flames

open access: yesJournal of Graph Theory, Volume 110, Issue 4, Page 392-397, December 2025.
ABSTRACT A directed graph F with a root node r is called a flame if for every vertex v other than r the local edge‐connectivity value λ F ( r , v ) from r to v is equal to ϱ F ( v ), the in‐degree of v. It is a classic, simple and beautiful result of Lovász [4] that every digraph D with a root node r has a spanning subgraph F that is a flame and the λ (
Dávid Szeszlér
wiley   +1 more source

Home - About - Disclaimer - Privacy