Search Results - mathematical optimization. approximation theory. internet programming. linear programming.

Multi-objective Task Scheduling in cloud-fog computing using goal programming approach by Najafizadeh, Abbas, Salajegheh, Afshin, Rahmani, Amir Masoud, Sahafi, Amir

“…Fog Computing continues to extend its usage by solving cloud computing challenges about Internet of Things (IoT…”
Get full text

The golden ticket: P, NP, and the search for the impossible by Fortnow, Lance

“…The P-NP problem is the most important open problem in computer science, if not all of mathematics.The Golden Ticketprovides a nontechnical introduction to…”
Get full text

Joint User Selection and Beamforming Design for Multi-IRS Aided Internet-of-Things Networks by Yoon, Seok-Hyun, Lim, Byungju, Vu, Mai, Ko, Young-Chai

“…Intelligent reflecting surface (IRS) has recently emerged as a promising technology for Internet-of-Things (IoT…”
Get full text

Energy-Efficient Optimization for Energy-Harvesting-Enabled mmWave-UAV Heterogeneous Networks by Zhang, Jinxi, Chuai, Gang, Gao, Weidong

“…Energy Harvesting (EH) is a promising paradigm for 5G heterogeneous communication. EH-enabled Device-to-Device (D2D) communication can assist devices in…”
Get full text

LP Relaxation-Based Approximation Algorithms for Maximizing Entangled Quantum Routing Rate by Nguyen, Tu N., Nguyen, Dung H. P., Pham, Dang H., Liu, Bing-Hong, Nguyen, Hoa N.

“… for the maximum number of demands in the quantum network while meeting the network's fidelity. We first formulate the MERR problem using an integer linear programming (ILP…”
Get full text

Downlink resource allocation for on-demand multimedia services in high-speed railway communication systems by Lei, Yan

“… Considering both the integrity and continuity of service transmission, the resource allocation problem is formulated as a two-stage optimization programming…”
Get full text

Efficient solutions to factored MDPs with imprecise transition probabilities by Delgado, Karina Valdivia, Sanner, Scott, de Barros, Leliane Nunes

“…) has been introduced to model such scenarios. Unfortunately, while various solution algorithms exist for MDP-IPs, they often require external calls to optimization routines and thus can be extremely…”
Get full text

Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding by Drwal, Maciej, Jozefczyk, Jerzy

“…—computer systems used to efficiently distribute Internet traffic to the users by replicating data objects…”
Get full text

Near-Optimal Asymmetric Binary Matrix Partitions by Abed, Fidaa, Caragiannis, Ioannis, Voudouris, Alexandros A.

“… (Proceedings of the 9th Conference on Web and Internet Economics (WINE), pp 1–14, 2013 ). Instances of the problem consist of an n…”
Get full text

A Convex Optimization Framework for Almost Budget Balanced Allocation of a Divisible Good by Chorppath, A. K., Bhashyam, S., Sundaresan, R.

“… Two performance criteria are of interest: the maximum ratio of budget surplus to efficient surplus, and the expected budget surplus, within the class of linear rebate functions…”
Get full text

Review of Models for and Socioeconomic Approaches to the Formation of Foresight Control Mechanisms: A Genesis by Alabugin, Anatoliy, Aliukov, Sergei, Khudyakova, Tatyana

“…The study of a genesis is determined by the needs when designing the processes of high-tech development. This is performed taking the knowledge-intensive…”
Get full text

Connectivity Upgrade Models for Survivable Network Design by Balakrishnan, Anantaram, Mirchandani, Prakash, Natarajan, Harihara Prasad

“… these inequalities are facet defining. By increasing the linear programming lower bound, the valid inequalities…”
Get full text

Minimizing the Installation Cost of Ground Stations in Satellite Networks: Complexity, Dynamic Programming and Approximation Algorithm by Efrem, Christos N, Panagopoulos, Athanasios D

“… First, we show that the optimization problem can be formulated as a binary-linear-programming problem, and then we give a formal proof of its NP-hardness…”
Get full text

Performance Evaluation of Capacitated Vertex Cover Algorithms for Security Applications in Wireless Sensor Networks by Yigit, Yasin, Dagdeviren, Zuleyha Akusta, Dagdeviren, Orhan, Challenger, Moharram

“… Vertex cover is a popular problem in the areas of graph theory, approximation algorithms and optimization…”
Get full text

End-to-End Restorable Oblivious Routing of Hose Model Traffic by Kodialam, M., Lakshman, T. V., Orlin, J. B., Sengupta, S.

“… We view this as important progress toward adding carrier-class reliability to the robustness of the scheme so as to facilitate its future deployment in Internet service provider (ISP) networks…”
Get full text

Multiple Perspective-Cuts Outer Approximation Method for Risk-Averse Operational Planning of Regional Energy Service Providers by Yang, Linfeng, Jian, Jinbao, Xu, Yan, Dong, Zhaoyang, Ma, Guodong

“… for such a RESP as a mixed-integer quadratically constrained programming (MIQCP), named as RA-RESP. A global optimization method, named as multiple perspective-cuts outer approximation method…”
Get full text

Maximizing Entanglement Routing Rate in Quantum Networks: Approximation Algorithms by Nguyen, Tu N, Nguyen, Dung H P, Pham, Dang H, Bing-Hong, Liu, Nguyen, Hoa N

“… for the maximum number of demands in the quantum network while meeting the network's fidelity. We first formulate the MERR problem using an integer linear programming (ILP…”
Get full text

Discrete optimization by Aardal, K. (Karen), Nemhauser, George L., Weismantel, R.

“… The handbook will be a useful reference to experts in the field as well as students and others who want to learn about discrete optimization…”
Get full text

Optimizing the Age of Information in Mixed-Critical Wireless Communication Networks by Robert-Jeron Reifert, Roth, Stefan, Aydin Sezgin

“…, we consider linear and exponential aging functions. An intricate non-convex optimization problem managing the physical transmission time and packet outage probability is derived…”
Get full text

Terahertz Meets Untrusted UAV-Relaying: Minimum Secrecy Energy Efficiency Maximization via Trajectory and Communication Co-design by Milad Tatar Mamaghani, Hong, Yi

“… Then, we devise an optimization framework in terms of a new measure \(-\) secrecy energy efficiency (SEE…”
Get full text