Results 51 to 60 of about 2,913,313 (303)
NORA: An Approach for Transforming Network Management Policies into Automated Planning Problems
Realizing autonomic management control loops is pivotal for achieving self-driving networks. Some studies have recently evidence the feasibility of using Automated Planning (AP) to carry out these loops. However, in practice, the use of AP is complicated
Angela Rodriguez-Vivas +4 more
doaj +1 more source
A Primal–Dual-Based Power Control Approach for Capacitated Edge Servers
The intensity of radio waves decays rapidly with increasing propagation distance, and an edge server’s antenna needs more power to form a larger signal coverage area.
Qinghui Zhang +3 more
doaj +1 more source
Surrogate modeling approximation using a mixture of experts based on EM joint estimation [PDF]
An automatic method to combine several local surrogate models is presented. This method is intended to build accurate and smooth approximation of discontinuous functions that are to be used in structural optimization problems.
Dimitri Bettebghor +9 more
core +1 more source
An Improved Approximation Algorithm for the Minimum Power Cover Problem with Submodular Penalty
In this paper, we consider the minimum power cover problem with submodular penalty (SPMPC). Given a set U of n users, a set S of m sensors and a penalty function π:2U→R+ on the plane, the relationship that adjusts the power p(s) of each sensor s and its ...
Han Dai
doaj +1 more source
ABSTRACT Background Embryonal tumors comprise the majority of malignant central nervous system (CNS) neoplasms diagnosed in children under 3 years of age. Compared with their counterparts in older children, these tumors exhibit distinct molecular biology and a more aggressive clinical phenotype, while their management is complicated by the heightened ...
Sudarshawn Damodharan +3 more
wiley +1 more source
Playing Games with Approximation Algorithms
In an online linear optimization problem, on each period $t$, an online algorithm chooses $s_t\in\mathcal{S}$ from a fixed (possibly infinite) set $\mathcal{S}$ of feasible decisions. Nature (who may be adversarial) chooses a weight vector $w_t\in\mathbb{R}^n$, and the algorithm incurs cost $c(s_t,w_t)$, where $c$ is a fixed cost function that is ...
Sham M. Kakade +2 more
openaire +4 more sources
Estimating the weight of metric minimum spanning trees in sublinear time [PDF]
In this paper we present a sublinear-time $(1+\varepsilon)$-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an $n$-point metric space. The running time of the algorithm is $\widetilde{\mathcal{O}}(n/\varepsilon^{\
Christian Sohler +3 more
core +1 more source
ABSTRACT Background Pediatric thromboembolism is increasingly encountered in critical care. Systemic thrombolysis with tissue plasminogen activator (tPA) facilitates vessel or valve patency, yet pediatric‐specific protocols remain undefined, and safety concerns persist. Objective To evaluate the efficacy and safety of a tailored, prolonged systemic tPA
Eran Shostak +5 more
wiley +1 more source
Radio Mean Labeling Algorithm, Its Complexity and Existence Results
Radio mean labeling of a connected graph G is an assignment of distinct positive integers to the vertices of G satisfying a mathematical constraint called radio mean condition. The maximum label assigned to any vertex of G is called the span of the radio
Meera Saraswathi +2 more
doaj +1 more source
Drones Routing with Stochastic Demand
Motivated by the increasing number of drones used for package delivery, we first study the problem of Multiple drOne collaborative Routing dEsign (MORE) in this article. That is, given a fixed number of drones and customers, determining the delivery trip
Nan Yu +6 more
doaj +1 more source

