Results 71 to 80 of about 1,909,109 (209)
Multi-objective Evolutionary Algorithms are Still Good: Maximizing Monotone Approximately Submodular Minus Modular Functions [PDF]
, 2022 As evolutionary algorithms (EAs) are general-purpose optimization algorithms, recent theoretical studies have tried to analyze their performance for solving general problem classes, with the goal of providing a general theoretical explanation of the ...
Qian, Chao
core
Multiuser computation offloading for edge-cloud collaboration using submodular optimization
Tongxin xuebao, 2020 A computation offloading scheme based on edge-cloud computing was proposed to improve the system utility of multiuser computation offloading.This scheme improved the system utility while considering the optimization of edge-cloud resources.In order to ...
Bing LIANG, Wen JI
doaj +2 more sources
Multi-Type Sensor Placements in Gaussian Spatial Fields for Environmental Monitoring
Sensors, 2019 As citizens are increasingly concerned about the surrounding environment, it is important for modern cities to provide sufficient and accurate environmental information to the public for decision making in the era of smart cities.
Chenxi Sun +3 more
doaj +1 more source
How to see the forest despite the trees
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract One of the major starting points of discrete optimization is the theorem of Nash‐Williams and Tutte on the existence of k$k$ disjoint spanning trees of a graph, along with its counterpart on the existence of k$k$ forests covering all edges of the graph.
Erika Bérczi‐Kovács, András Frank
wiley +1 more source
Lower bounds for cube‐ideal set‐systems
Proceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.Abstract A set‐system S⊆{0,1}n$S\subseteq \lbrace 0,1\rbrace ^n$ is cube‐ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential lower bounds on the size of cube‐ideal set‐systems, and linear lower bounds on their ...
Ahmad Abdi +3 more
wiley +1 more source
On Unconstrained Quasi-Submodular Function Optimization
Proceedings of the AAAI Conference on Artificial Intelligence, 2015 With the extensive application of submodularity, its generalizations are constantly being proposed. However, most of them are tailored for special problems. In this paper, we focus on quasi-submodularity, a universal generalization, which satisfies weaker properties than submodularity but still enjoys favorable performance in ...
Jincheng Mei, Kang Zhao, Bao-Liang Lu
openaire +2 more sources
IET Renewable Power Generation, 2023 This paper aims to present an optimization method for the best bus selection (BBS) in the large‐scale power systems in order to send the input signals to the damping controllers.
Mohsen Darabian +2 more
doaj +1 more source
Efficient investment, search, and sorting in matching markets
Theoretical Economics, Volume 21, Issue 3, Page 810-848, July 2026.We study markets where heterogeneous agents first make investment decisions and then engage in a costly search to form productive matches. The trading process is a random search and bargaining with explicit search costs. Despite potential hold‐up and matching problems, we prove that the constrained efficient allocation is an equilibrium: the agents ...
Alp Atakan, Michael Richter, Matan Tsur
wiley +1 more source
Entity Canonicalization Method Based on Dual-View Contrastive Learning and Submodular Optimization [PDF]
Jisuanji gongchengEntity redundancy, where multiple nodes represent the same real-world entity due to heterogeneous data sources or extraction errors, severely affects the quality and utility of Knowledge Graphs (KG). To address the problem of Entity Canonicalization (EC)
XUE Hanbing, NI Chen, LI Yuying, GUAN Jia, FANG Kai, CUI Wenqian
doaj +1 more source