Results 41 to 50 of about 11,364 (178)
Mechanism Design via Correlation Gap [PDF]
, 2010 For revenue and welfare maximization in single-dimensional Bayesian settings, Chawla et al. (STOC10) recently showed that sequential posted-price mechanisms (SPMs), though simple in form, can perform surprisingly well compared to the optimal mechanisms ...
Yan, Qiqi
core +2 more sources
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
Hardness of submodular cost allocation : lattice matching and a simplex coloring conjecture [PDF]
, 2014 We consider the Minimum Submodular Cost Allocation (MSCA) problem. In this problem, we are given k submodular cost functions f1, ... , fk: 2V -> R+ and the goal is to partition V into k sets A1, ..., Ak so as to minimize the total cost sumi = 1,k fi(Ai).
Ene, Alina, Vondrák, Jan
core +2 more sources
A simple combinatorial algorithm for submodular function minimization [PDF]
, 2009 This paper presents a new simple algorithm for minimizing submodular functions. For integer valued submodular functions, the algorithm runs in O(n6EO log nM) [O (n superscript 6 E O log nM)] time, where n is the cardinality of the ground set, M is the ...
Iwata, Satoru, Orlin, James B.
core +1 more source
Symmetric Submodular Function Minimization Under Hereditary Family Constraints
, 2010 We present an efficient algorithm to find non-empty minimizers of a symmetric submodular function over any family of sets closed under inclusion. This for example includes families defined by a cardinality constraint, a knapsack constraint, a matroid ...
Goemans, Michel X., Soto, José A.
core +2 more sources
Ranking with Submodular Valuations [PDF]
, 2010 We study the problem of ranking with submodular valuations. An instance of this problem consists of a ground set $[m]$, and a collection of $n$ monotone submodular set functions $f^1, \ldots, f^n$, where each $f^i: 2^{[m]} \to R_+$.
Azar, Yossi, Gamzu, Iftah
core +3 more sources
You Can Recharge With Detouring: Optimizing Placement for Roadside Wireless Charger
IEEE Access, 2018 Wireless energy transfer technologies have played an important role in the development of Internet of Things. Most of the previous studies focus on scheduling mobile chargers efficiently for rechargeable sensor nodes.
Xunpeng Rao +6 more
doaj +1 more source
Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions [PDF]
, 2015 The Adaptive Seeding problem is an algorithmic challenge motivated by influence maximization in social networks: One seeks to select among certain accessible nodes in a network, and then select, adaptively, among neighbors of those nodes as they become ...
Badanidiyuru, Ashwinkumar +4 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
Streaming Algorithms for Submodular Function Maximization
, 2015 We consider the problem of maximizing a nonnegative submodular set function $f:2^{\mathcal{N}} \rightarrow \mathbb{R}^+$ subject to a $p$-matchoid constraint in the single-pass streaming setting.
A Badanidiyuru Varadaraja +16 more
core +1 more source