Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"polymatroid"”.
-
Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut)
… are considered, including the finite polymatroid networks of Lawler.
-
Fair resource allocation in multiple access channels
… uses approximate projection. By exploiting the polymatroid structure of the capacity region, we show that the approximate projection can be implemented in time polynomial in the number of users. Second, we consider resource allocation in a fading channel. Optimal rate and power allocation …
-
Optimizing Placement and Delivery for Coded Caching
… via a subspace decomposition over representable polymatroid spaces. We derive the lower bound of optimal limits of the decentralized coded caching with random linear coding placement when the projection is exactly 1 file, which is achievable at most 3 users or certain conditions hold.
-
Exploration vs. exploitation : reducing uncertainty in operational problems
… constraint polyhedron has the structure of a polymatroid. We characterize the optimal policy and show that similar types of policies optimally govern testing decisions in this setting as well.
-
Feasibility optimality of periodwise static priority policies for a quality of service model in wireless networks and convergence analysis for an online recommendation system
… by the timely-throughput constraints is a polymatroid, from which the optimality within the class of periodwise static priority poli- cies follows. The second part of the thesis analyzes the convergence of an algorithm for the problem of learning with expert advice. At the present time, …
-
Performance bounds for greedy strategies in submodular optimization problems
To view the abstract, please see the full text of the document.