English
Related papers

Related papers: The Hardness of Optimization Problems on the Weigh…

200 papers

Reconfigurable optical topologies are a promising new technology to improve datacenter network performance and cope with the explosive growth of traffic. In particular, these networks allow to directly and adaptively connect racks between…

Networking and Internet Architecture · Computer Science 2023-08-31 Marcin Bienkowski , David Fuchssteiner , Stefan Schmid

Parameterized complexity theory offers a framework for a refined analysis of hard algorithmic problems. Instead of expressing the running time of an algorithm as a function of the input size only, running times are expressed with respect to…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-02-18 Sebastian Siebertz , Alexandre Vigny

We study the scalability of consensus-based distributed optimization algorithms by considering two questions: How many processors should we use for a given problem, and how often should they communicate when communication is not free?…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-09-06 Konstantinos I. Tsianos , Sean Lawlor , Michael G. Rabbat

As software may be used by multiple users, caching popular software at the wireless edge has been considered to save computation and communications resources for mobile edge computing (MEC). However, fetching uncached software from the core…

Information Theory · Computer Science 2020-05-07 Wanli Wen , Ying Cui , Tony Q. S. Quek , Fu-Chun Zheng , Shi Jin

Wireless Powered Mobile Edge Computing (WP-MEC) integrates mobile edge computing (MEC) with wireless power transfer (WPT) to simultaneously extend the operational lifetime and enhance the computational capability of wireless devices (WDs).…

Networking and Internet Architecture · Computer Science 2026-03-10 Xingqiu He , Chaoqun You , Yuzhi Yang , Zihan Chen , Yuhang Shen , Tony Q. S. Quek , Yue Gao

In this paper, we investigate three fundamental problems in the Massively Parallel Computation (MPC) model: (i) grid graph connectivity, (ii) approximate Euclidean Minimum Spanning Tree (EMST), and (iii) approximate DBSCAN. Our first result…

Data Structures and Algorithms · Computer Science 2025-01-22 Junhao Gan , Anthony Wirth , Zhuo Zhang

A communication network can be modeled as a directed connected graph with edge weights that characterize performance metrics such as loss and delay. Network tomography aims to infer these edge weights from their pathwise versions measured…

Optimization and Control · Mathematics 2019-08-12 Mahmood Ettehad , Nick Duffield , Gregory Berkolaiko

A large-scale complex system comprising many, often spatially distributed, dynamical subsystems with partial autonomy and complex interactions are called system of systems. This paper describes an efficient algorithm for model predictive…

Optimization and Control · Mathematics 2019-04-25 Branimir Novoselnik , Vedrana Spudić , Mato Baotić

Containers are used by an increasing number of Internet service providers to deploy their applications in multi-access edge computing (MEC) systems. Although container-based virtualization technologies significantly increase application…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-24 Ao Liu , Shaoshi Yang , Jingsheng Tan , Zongze Liang , Jiasen Sun , Tao Wen , Hongyan Yan

Mobile Edge Computing (MEC) enables rich services in close proximity to the end users to provide high quality of experience (QoE) and contributes to energy conservation compared with local computing, but results in increased communication…

Networking and Internet Architecture · Computer Science 2020-03-31 Mingxiong Zhao , Jun-Jie Yu , Wen-Tao Li , Di Liu , Shaowen Yao , Wei Feng , Changyang She , Tony Q. S. Quek

Fixed-parameter tractability analysis and scheduling are two core domains of combinatorial optimization which led to deep understanding of many important algorithmic questions. However, even though fixed-parameter algorithms are appealing…

Data Structures and Algorithms · Computer Science 2013-11-19 Matthias Mnich , Andreas Wiese

Solving the shortest path and the min-cut problems are key in achieving high performance and robust communication networks. Those problems have often beeny studied in deterministic and independent networks both in their original…

Data Structures and Algorithms · Computer Science 2016-02-02 Song Yang , Stojan Trajanovski , Fernando A. Kuipers

This paper studies a fundamental algorithmic problem related to the design of demand-aware networks: networks whose topologies adjust toward the traffic patterns they serve, in an online manner. The goal is to strike a tradeoff between the…

Data Structures and Algorithms · Computer Science 2020-04-07 Chen Avin , Kaushik Mondal , Stefan Schmid

Emerging reconfigurable optical communication technologies allow to enhance datacenter topologies with demand-aware links optimized towards traffic patterns. This paper studies the algorithmic problem of jointly optimizing topology and…

Performance · Computer Science 2024-01-10 Wenkai Dai , Michael Dinitz , Klaus-Tycho Foerster , Long Luo , Stefan Schmid

This work introduces a formulation of model predictive control (MPC) which adaptively reasons about the complexity of the model based on the task while maintaining feasibility and stability guarantees. Existing MPC implementations often…

Robotics · Computer Science 2024-11-07 Joseph Norby , Ardalan Tajbakhsh , Yanhao Yang , Aaron M. Johnson

Geometric programming problems occur frequently in engineering design and management. In multiobjective optimization, the trade-off information between different objective functions is probably the most important piece of information in a…

Data Structures and Algorithms · Computer Science 2010-03-25 A. K. Ojha , A. K. Das

In secure multiparty computation (MPC), mutually distrusting users collaborate to compute a function of their private data without revealing any additional information about their data to other users. While it is known that information…

Cryptography and Security · Computer Science 2016-11-17 Deepesh Data , Vinod M. Prabhakaran , Manoj M. Prabhakaran

We study the cost of distributed MST construction in the setting where each edge has a latency and a capacity, along with the weight. Edge latencies capture the delay on the links of the communication network, while capacity captures their…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-01-15 John Augustine , Seth Gilbert , Fabian Kuhn , Peter Robinson , Suman Sourav

We study three capacity problems in the mobile telephone model, a network abstraction that models the peer-to-peer communication capabilities implemented in most commodity smartphone operating systems. The capacity of a network expresses…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-09 Michael Dinitz , Magnús M. Halldórsson , Calvin Newport , Alex Weaver

New developments in HPC technology in terms of increasing computing power on multi/many core processors, high-bandwidth memory/IO subsystems and communication interconnects, pose a direct impact on software and runtime system development.…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-22 Udayanga Wickramasinghe , Andrew Lumsdaine
‹ Prev 1 4 5 6 7 8 10 Next ›