Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Supittayapornpong, Sucha"'
The freshness of real-time status processing of time-sensitive information is crucial for several applications, including healthcare monitoring and autonomous vehicles. This freshness is considered in this paper for the system where unprocessed infor
Externí odkaz:
http://arxiv.org/abs/2210.00956
Autor:
Ngoenriang, Napat, Xu, Minrui, Supittayapornpong, Sucha, Niyato, Dusit, Yu, Han, Xuemin, Shen
With the advent of interconnected quantum computers, i.e., distributed quantum computing (DQC), multiple quantum computers can now collaborate via quantum networks to perform massively complex computational tasks. However, DQC faces problems sharing
Externí odkaz:
http://arxiv.org/abs/2210.02886
We focus on sorting, which is the building block of many machine learning algorithms, and propose a novel distributed sorting algorithm, named Coded TeraSort, which substantially improves the execution time of the TeraSort benchmark in Hadoop MapRedu
Externí odkaz:
http://arxiv.org/abs/1702.04850
Traffic load-balancing in datacenters alleviates hot spots and improves network utilization. In this paper, a stable in-network load-balancing algorithm is developed in the setting of software-defined networking. A control plane configures a data pla
Externí odkaz:
http://arxiv.org/abs/1612.01684
This paper considers time-average optimization, where a decision vector is chosen every time step within a (possibly non-convex) set, and the goal is to minimize a convex function of the time averages subject to convex constraints on these averages.
Externí odkaz:
http://arxiv.org/abs/1610.02617
Stochastic non-smooth convex optimization constitutes a class of problems in machine learning and operations research. This paper considers minimization of a non-smooth function based on stochastic subgradients. When the function has a locally polyhe
Externí odkaz:
http://arxiv.org/abs/1607.02842
One practical open problem is the development of a distributed algorithm that achieves near-optimal utility using only a finite (and small) buffer size for queues in a stochastic network. This paper studies utility maximization (or cost minimization)
Externí odkaz:
http://arxiv.org/abs/1501.03457
This paper considers time-average stochastic optimization, where a time average decision vector, an average of decision vectors chosen in every time step from a time-varying (possibly non-convex) set, minimizes a convex objective function and satisfi
Externí odkaz:
http://arxiv.org/abs/1412.4509
An information collection problem in a wireless network with random events is considered. Wireless devices report on each event using one of multiple reporting formats. Each format has a different quality and uses different data lengths. Delivering a
Externí odkaz:
http://arxiv.org/abs/1211.6162
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.