English
Related papers

Related papers: SeedTree: A Dynamically Optimal and Local Self-Adj…

200 papers

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

State-of-the-art topologies for datacenters (DC) and high-performance computing (HPC) networks are demand-oblivious and static. Therefore, such network topologies are optimized for the worst-case traffic scenarios and can't take advantage…

Networking and Internet Architecture · Computer Science 2022-02-02 Chen Griner , Gil Einziger , Chen Avin

This paper studies the design of self-adjusting networks whose topology dynamically adapts to the workload, in an online and demand-aware manner. This problem is motivated by emerging optical technologies which allow to reconfigure the…

Networking and Internet Architecture · Computer Science 2019-04-09 Chen Avin , Stefan Schmid

Innovative shared mobility services provide on-demand flexible mobility options and have the potential to alleviate traffic congestion. These attractive services are challenging from different perspectives. One major challenge in such…

Data Structures and Algorithms · Computer Science 2020-05-25 Rui Yao , Shlomo Bekhor

Emerging networked systems become increasingly flexible and reconfigurable. This introduces an opportunity to adjust networked systems in a demand-aware manner, leveraging spatial and temporal locality in the workload for online…

Data Structures and Algorithms · Computer Science 2019-05-08 Chen Avin , Ingo van Duijn , Stefan Schmid

Self-adjusting computation is an approach for automatically producing dynamic algorithms from static ones. The approach works by tracking control and data dependencies, and propagating changes through the dependencies when making an update.…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-05-17 Daniel Anderson , Guy E. Blelloch , Anubhav Baweja , Umut A. Acar

Dynamic regression trees are an attractive option for automatic regression and classification with complicated response surfaces in on-line application settings. We create a sequential tree model whose state changes in time with the…

Methodology · Statistics 2010-11-23 Matthew A. Taddy , Robert B. Gramacy , Nicholas G. Polson

For the purpose of propagating information and ideas through a social network, a seeding strategy aims to find a small set of seed users that are able to maximize the spread of the influence, which is termed as influence maximization…

Social and Information Networks · Computer Science 2016-07-05 Guangmo Tong , Weili Wu , Shaojie Tang , Ding-Zhu Du

The physical topology is emerging as the next frontier in an ongoing effort to render communication networks more flexible. While first empirical results indicate that these flexibilities can be exploited to reconfigure and optimize the…

Networking and Internet Architecture · Computer Science 2018-07-10 Chen Avin , Stefan Schmid

On-demand peer-to-peer ride-sharing services provide flexible mobility options, and are expected to alleviate congestion by sharing empty car seats. An efficient matching algorithm is essential to the success of a ride-sharing system. The…

Data Structures and Algorithms · Computer Science 2021-05-28 Rui Yao , Shlomo Bekhor

Datacenter networks are becoming increasingly flexible with the incorporation of new networking technologies, such as optical circuit switches. These technologies allow for programmable network topologies that can be reconfigured to better…

Networking and Internet Architecture · Computer Science 2024-06-28 Evgenii Feder , Anton Paramonov , Pavel Mavrin , Iosif Salem , Stefan Schmid , Vitaly Aksenov

Given a network infrastructure (e.g., data-center or on-chip-network) and a distribution on the source-destination requests, the expected path (route) length is an important measure for the performance, efficiency and power consumption of…

Networking and Internet Architecture · Computer Science 2012-07-06 Chen Avin , Michael Borokhovich , Bernhard Haeupler , Zvi Lotker

The paper presents an algorithm, called Self-Morphing Adaptive Replanning Tree (SMART), that facilitates fast replanning in dynamic environments. SMART performs risk based tree-pruning if the current path is obstructed by nearby moving…

Robotics · Computer Science 2023-09-22 Zongyuan Shen , James P. Wilson , Shalabh Gupta , Ryan Harvey

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…

Social and Information Networks · Computer Science 2015-07-10 Ashwinkumar Badanidiyuru , Christos Papadimitriou , Aviad Rubinstein , Lior Seeman , Yaron Singer

Answering connectivity queries is fundamental to fully dynamic graphs where edges and vertices are inserted and deleted frequently. Existing work proposes data structures and algorithms with worst-case guarantees. We propose a new data…

Data Structures and Algorithms · Computer Science 2022-07-19 Qing Chen , Oded Lachish , Sven Helmer , Michael Böhlen

Decision tree learning is a widely used approach in machine learning, favoured in applications that require concise and interpretable models. Heuristic methods are traditionally used to quickly produce models with reasonably high accuracy.…

We revisit the design of self-adjusting single-source tree networks. The problem can be seen as a generalization of the classic list update problem to trees, and finds applications in reconfigurable datacenter networks. We are given a fixed…

Data Structures and Algorithms · Computer Science 2022-04-25 Chen Avin , Marcin Bienkowski , Iosif Salem , Robert Sama , Stefan Schmid , Paweł Schmidt

Demand-aware communication networks are networks whose topology is optimized toward the traffic they need to serve. These networks have recently been enabled by novel optical communication technologies and are investigated intensively in…

Networking and Internet Architecture · Computer Science 2024-03-07 Maxim Buzdalov , Pavel Martynov , Sergey Pankratov , Vitaly Aksenov , Stefan Schmid

Emerging reconfigurable datacenters allow to dynamically adjust the network topology in a demand-aware manner. These datacenters rely on optical switches which can be reconfigured to provide direct connectivity between racks, in the form of…

Networking and Internet Architecture · Computer Science 2025-03-19 Kathrin Hanauer , Monika Henzinger , Lara Ost , Stefan Schmid

Robots have become increasingly prevalent in dynamic and crowded environments such as airports and shopping malls. In these scenarios, the critical challenges for robot navigation are reliability and timely arrival at predetermined…

Robotics · Computer Science 2023-09-21 Zhirui Sun , Boshu Lei , Peijia Xie , Fugang Liu , Junjie Gao , Ying Zhang , Jiankun Wang
‹ Prev 1 2 3 10 Next ›