Results 61 to 70 of about 10,146,366 (200)
Near Optimal Dynamic Mobile Advertisement Offloading With Time Constraints
IEEE Access, 2019 Owing to the accuracy and flexibility, mobile advertising has become a very attractive marketing method based on smart mobile terminals. The more common mobile advertisement distribution methods are based on location and content.
Wanru Xu, Chaocan Xiang, Chang Tian
doaj +1 more source
Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover [PDF]
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013 Stochastic Boolean Function Evaluation is the problem of determining the value of a given Boolean function f on an unknown input x, when each bit of x_i of x can only be determined by paying an associated cost c_i. The assumption is that x is drawn from a given product distribution, and the goal is to minimize the expected cost.
Amol Deshpande +2 more
openaire +2 more sources
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
Queue-Aware Cell Activation and User Association for Traffic Offloading via Dual-Connectivity
IEEE Access, 2019 With the objective of reducing energy cost, we study the stochastic optimization of traffic off-loading via dual-connectivity by joint cell activation and user association.
Qiaoni Han, Bo Yang, Xiaocheng Wang
doaj +1 more source
Application of an Open‐Source Modular Framework for Pharmacokinetic, Pharmacodynamic, and Safety Simulations to Anti‐Tuberculosis Drugs [PDF]
CPT Pharmacometrics Syst PharmacolABSTRACT Tuberculosis (TB) treatment requires long‐term multidrug regimens where dosing, efficacy, and safety optimization remain challenging. This tutorial establishes an integrated, open‐source, modular framework connecting high‐throughput PBPK (HT‐PBPK) simulations, mechanistic PBPK models, pharmacodynamic endpoints, and safety predictions for anti ...
Siccardi M +9 more
europepmc +2 more sources
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
Supermodular Rank: Set Function Decomposition and Optimization
, 2023 We define the supermodular rank of a function on a lattice. This is the smallest number of terms needed to decompose it into a sum of supermodular functions. The supermodular summands are defined with respect to different partial orders.
Montufar, Guido +2 more
core
CAAI Transactions on Intelligence Technology, Volume 11, Issue 3, Page 920-934, June 2026.ABSTRACT Networked control systems (NCSs) often suffer from performance degradation due to limited communication bandwidth, which can cause data transmission conflicts and packet loss. Existing scheduling strategies may fail to simultaneously meet the real‐time requirements and the importance of multisensor data, and they are particularly vulnerable ...
Da Chen +5 more
wiley +1 more source
Maximizing non-monotone submodular set functions subject to different constraints: Combined algorithms [PDF]
Operations Research Letters, 2011 We study the problem of maximizing constrained non-monotone submodular functions and provide approximation algorithms that improve existing algorithms in terms of either the approximation factor or simplicity. Our algorithms combine existing local search and greedy based algorithms. Different constraints that we study are exact cardinality and multiple
Salman Fadaei +2 more
openaire +3 more sources
Polymatroidal tilings and the Chow class of linked projective spaces
Bulletin of the London Mathematical Society, Volume 58, Issue 5, May 2026.Abstract Linked projective spaces are quiver Grassmannians of constant dimension one of certain quiver representations, called linked nets, over certain quivers, called Zn$\mathbb {Z}^n$‐quivers. They were recently introduced as a tool for describing schematic limits of families of divisors.
Felipe de Leon, Eduardo Esteves
wiley +1 more source