Results 21 to 30 of about 8,315,593 (358)
Optimal Distributed Covering Algorithms [PDF]
AbstractWe present a time-optimal deterministic distributed algorithm for approximating a minimum weight vertex cover in hypergraphs of rank f. This problem is equivalent to the Minimum Weight Set Cover problem in which the frequency of every element is bounded by f. The approximation factor of our algorithm is $$(f+\varepsilon )$$
Ben-Basat, Ran+3 more
openaire +7 more sources
Multimodal Estimation of Distribution Algorithms [PDF]
Taking the advantage of estimation of distribution algorithms (EDAs) in preserving high diversity, this paper proposes a multimodal EDA. Integrated with clustering strategies for crowding and speciation, two versions of this algorithm are developed, which operate at the niche level.
Yang, Qiang+5 more
openaire +4 more sources
A Fast Distributed Algorithm for Large-Scale Demand Response Aggregation [PDF]
A major challenge to implementing residential demand response is that of aligning the objectives of many households, each of which aims to minimize its payments and maximize its comfort level, while balancing this with the objectives of an aggregator ...
Sleiman Mhanna+2 more
semanticscholar +1 more source
Distributed Systems and Algorithms [PDF]
Despite an impressive body of research, parallel and distributed computing remains a complex task prone to subtle software issues that can affect both the correctness and the performance of the computation. The increasing demand to distribute computing over large-scale parallel and distributed platforms, such as grids and large clusters, often combined
Giandomenico Spezzano+3 more
openaire +4 more sources
A Distributed Approach to the Evasion Problem
The Evasion Problem is the question of whether—given a collection of sensors and a particular movement pattern over time—it is possible to stay undetected within the domain over the same stretch of time.
Denis Khryashchev+3 more
doaj +1 more source
Distributed Algorithms for Fractional Coloring [PDF]
In this paper we study fractional coloring from the angle of distributed computing. Fractional coloring is the linear relaxation of the classical notion of coloring, and has many applications, in particular in scheduling. It was proved by Hasemann, Hirvonen, Rybicki and Suomela (2016) that for every real $ >1$ and integer $ $, a fractional ...
Bousquet, Nicolas+2 more
openaire +3 more sources
A distributed quantile estimation algorithm of heavy-tailed distribution with massive datasets
Quantile estimation with big data is still a challenging problem in statistics. In this paper we introduce a distributed algorithm for estimating high quantiles of heavy-tailed distributions with massive datasets.
Xiaoyue Xie, Jian Shi
doaj +1 more source
A Cyclic Distributed Garbage Collector for Network Objects [PDF]
This paper presents an algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. The algorithm is based on a reference listing scheme, which is augmented by partial tracing in order to collect ...
Jones, Richard E.+1 more
core +3 more sources
Coordinated Autonomous Vehicle Parking for Vehicle-to-Grid Services: Formulation and Distributed Algorithm [PDF]
Autonomous vehicles (AVs) will revolutionarize ground transport and take a substantial role in the future transportation system. Most AVs are likely to be electric vehicles (EVs) and they can participate in the vehicle-to-grid (V2G) system to support ...
Albert Y. S. Lam+3 more
semanticscholar +1 more source
A Base Station DTX Scheme for OFDMA Cellular Networks Powered by the Smart Grid
Discontinuous transmission (DTX) is an efficient technology to improve the energy efficiency of the wireless cellular networks. DTX enables the deactivation of some components of the base station in sufficient short time, which can decrease the energy ...
Qiang Wang, Feng Zhao, Tiejun Chen
doaj +1 more source