Results 111 to 120 of about 5,146,266 (215)
Learning and Optimization with Submodular Functions
CoRR, 2015 Tech Report - USC Computer Science CS-599, Convex and Combinatorial ...
Bharath Sankaran +4 more
openaire +2 more sources
A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks
, 2010 In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus interfere with one another) is a major challenge.
Jennings, Nick +2 more
core +1 more source
Applied 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
On the Non-Submodularity of the Problem of Adding Links to Minimize the Effective Graph Resistance
Journal of Graph Algorithms and ApplicationsWe consider the optimisation problem of adding $k$ links to a given network, such that the resulting effective graph resistance is as small as possible.
Massimo A. Achterberg, Robert E. Kooij
doaj +1 more source
Multimodal Hierarchical Dirichlet Process-Based Active Perception by a Robot
Frontiers in Neurorobotics, 2018 In this paper, we propose an active perception method for recognizing object categories based on the multimodal hierarchical Dirichlet process (MHDP). The MHDP enables a robot to form object categories using multimodal information, e.g., visual, auditory,
Tadahiro Taniguchi +2 more
doaj +1 more source
Submodular functions in graph theory
Discrete Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Dynamic Stepsize Techniques in DR-Submodular Maximization
MathematicsThe Diminishing-Return (DR)-submodular function maximization problem has garnered significant attention across various domains in recent years. Classic methods often employ continuous greedy or Frank–Wolfe approaches to tackle this problem; however, high
Yanfei Li, Min Li, Qian Liu, Yang Zhou
doaj +1 more source
Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints
, 2013 We investigate two new optimization problems — minimizing a submodular function subject to a submodular lower bound constraint (submodular cover) and maximizing a submodular function subject to a submodular upper bound constraint (submodular knapsack ...
Rishabh Iyer, Jeff Bilmes
core
Improved Lower Bounds for Submodular Function Minimization
, 2022 We provide a generic technique for constructing families of submodular functions to obtain lower bounds for submodular function minimization (SFM). Applying this technique, we prove that any deterministic SFM algorithm on a ground set of $n$ elements ...
Graur, Andrei +3 more
core
A Note on Schrijver’s Submodular Function Minimization Algorithm [PDF]
, 2003 We prove that Schrijver’s submodular function minimization algorithm is faster by a factor of n than was proved by Schrijver in his ...
Vygen, Jens, Jens Vygen
core +1 more source