Results 51 to 60 of about 7,855,956 (309)
Optimal Distributed Covering Algorithms [PDF]
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019 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 )$$
Ran Ben-Basat +3 more
openaire +7 more sources
Sensors, 2021 With a constant increase in the number of deployed satellites, it is expected that the current fixed spectrum allocation in satellite communications (SATCOM) will migrate towards more dynamic and flexible spectrum sharing rules.
Irfan Jabandžić +6 more
doaj +1 more source
Fast distributed algorithms for testing graph properties [PDF]
Distributed computing, 2016 We initiate a thorough study of distributed property testing—producing algorithms for the approximation problems of property testing in the CONGEST model.
K. Censor-Hillel +3 more
semanticscholar +1 more source
Parameterized Distributed Algorithms
CoRR, 2018 In this work, we initiate a thorough study of parameterized graph optimization problems in the distributed setting. In a parameterized problem, an algorithm decides whether a solution of size bounded by a \emph{parameter} $k$ exists and if so, it finds one.
Ran Ben-Basat +2 more
openaire +4 more sources
Spectral Quantum Chemistry and Infrared Resonance Library for Data-Driven Molecular Spectroscopy
Scientific DataInfrared (IR) spectroscopy is a fundamental tool for molecular identification and characterization, yet comprehensive IR spectral databases remain limited, particularly for small organic molecules with well-defined theoretical baselines.
Anirudh Krishnadas +3 more
doaj +1 more source
Distributed Algorithms for Robust Convex Optimization via the Scenario Approach [PDF]
IEEE Transactions on Automatic Control, 2016 This paper proposes distributed algorithms to solve robust convex optimization (RCO) when the constraints are affected by nonlinear uncertainty. We adopt a scenario approach by randomly sampling the uncertainty set.
Keyou You, R. Tempo, Pei Xie
semanticscholar +1 more source
An algorithm for distributive unification [PDF]
, 1996 The purpose of this paper is to describe a decision algorithm for unifiability of equations w.r.t. the equational theory of two distributive axioms: x*(y+z)=x*y+x*z and (x+y)*z=x*z + y*z. The algorithm is described as a set of non-deterministic transformation rules.
openaire +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background An earlier study on children diagnosed with acute lymphoblastic leukemia (ALL) at Moi Teaching and Referral Hospital (MTRH) in Kenya reported a low event‐free survival (EFS), excess treatment abandonment, and high induction mortality.
Gilbert Olbara +7 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT As part of the European Cooperative Study Group for Paediatric Rare Tumours initiative, we developed standard clinical practice guidelines for ovarian sex cord stromal tumors, based on comprehensive national and international cohort analyses, literature review, and a final expert consensus conference.
Dominik T. Schneider +15 more
wiley +1 more source
Derandomizing local distributed algorithms under bandwidth restrictions [PDF]
Distributed computing, 2016 This paper addresses the cornerstone family of local problems in distributed computing, and investigates the curious gap between randomized and deterministic solutions under bandwidth restrictions.
K. Censor-Hillel +2 more
semanticscholar +1 more source