Results 31 to 40 of about 3,054,349 (257)

A Primal–Dual-Based Power Control Approach for Capacitated Edge Servers

open access: yesSensors, 2022
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

A 9/7 -Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs [PDF]

open access: yes, 2014
We prove new results for approximating Graphic TSP. Specifically, we provide a polynomial-time 9/7-approximation algorithm for cubic bipartite graphs and a (9/7+1/(21(k-2)))-approximation algorithm for k-regular bipartite graphs, both of which are ...
Jeremy A. Karp   +3 more
core   +1 more source

An Improved Approximation Algorithm for the Minimum Power Cover Problem with Submodular Penalty

open access: yesComputation, 2022
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

Identifying Patterns of Hospitalizations Among Childhood Cancer Survivors: A Population‐Based Study

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Childhood cancer survivors (CCSs) experience more hospitalizations than the general population. We aimed to identify distinct hospitalization patterns among Queensland CCSs and the associated characteristics. Methods Cases (aged ≤14 years) diagnosed between 1995 and 2019 while residents of Queensland were identified through the ...
Hai Pham   +7 more
wiley   +1 more source

Radio Mean Labeling Algorithm, Its Complexity and Existence Results

open access: yesMathematics
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

Feeding, Fear, and Acceptance: Caregivers’ Experiences of Nutritional Support During Childhood Cancer Treatment

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Purpose To explore caregivers' experiences and perceptions of the nutritional challenges faced by children and adolescents undergoing cancer treatment, including oral intake and the use of nutritional support. Methods This was a qualitative study based on focus groups with parents and caregivers at a Brazilian pediatric oncology hospital ...
Danyelle Apparecida Balsamão Marques   +5 more
wiley   +1 more source

Orthogonal Basis Extreme Learning Algorithm and Function Approximation

open access: yes, 2015
A new algorithm for single hidden layer feedforward neural networks (SLFN), Orthogonal Basis Extreme Learning (OBEL) algorithm, is proposed and the algorithm derivation is given in the paper.
Ying Li   +5 more
core   +1 more source

Drones Routing with Stochastic Demand

open access: yesDrones, 2023
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

Uncovering Inequities: The Role of Social Determinants of Health in Hospitalized Adolescents and Young Adults With Heavy Menstrual Bleeding

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Heavy menstrual bleeding (HMB) is a common condition among adolescents and young adults (AYAs) and is the leading cause of iron deficiency anemia (IDA) in this population. Growing evidence suggests that social determinants of health (SDOH) influence menstrual bleeding patterns, access to care, and treatment. However, no studies have
Maria Carter‐Febres   +6 more
wiley   +1 more source

Approximating a Minimum Dominating Set by Purification

open access: yesAlgorithms
A dominating set of a graph is a subset of vertices such that every vertex not in the subset has at least one neighbor within the subset. The corresponding optimization problem is known to be NP-hard.
Ernesto Parra Inza   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy