Results 61 to 70 of about 2,913,313 (303)

Forecasting the Dialysis Burden in Japan: Validation‐Based Projections of Prevalence and Incidence Through 2050

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Japan has one of the highest dialysis prevalence rates worldwide and a shrinking, aging population. Whether dialysis burden has entered a sustained post‐peak phase or whether recent declines partly reflect pandemic‐related disruptions remains uncertain.
Hatice Şahin   +2 more
wiley   +1 more source

Approximation Algorithms for the Submodular Load Balancing with Submodular Penalties

open access: yesMathematics, 2020
In this paper, we study the submodular load balancing problem with submodular penalties. The objective of this problem is to balance the load among sets, while some elements can be rejected by paying some penalties. Officially, given an element set V, we
Xiaofei Liu, Peiyin Xing, Weidong Li
doaj   +1 more source

Rounding in ¿-approximation algorithms

open access: yes2006 Symposium on Communications and Vehicular Technology, 2006
A common approach to deal with NP-hard problems is to deploy polynomial-time ϵ-approximation algorithms. These algorithms often resort to rounding and scaling to guarantee a solution that is within a factor (1 + isin) of the optimal solution. Usually, researchers either only round up or only down.
openaire   +4 more sources

Exact and Approximation Algorithms for Clustering [PDF]

open access: yesAlgorithmica, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pankaj K. Agarwal   +1 more
openaire   +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

Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements [PDF]

open access: yes, 2014
We consider degree bounded network design problems with element and vertex connectivity requirements. In the degree bounded Survivable Network Design (SNDP) problem, the input is an undirected graph G = (V, E) with weights w(e) on the edges and degree ...
Ali Vakilian   +3 more
core   +1 more source

Association Between Individualized Education for Kidney Replacement Therapy Modality Selection and Peritoneal Dialysis Initiation: A Cross‐Sectional Study

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction Peritoneal dialysis (PD) is an established home‐based kidney replacement therapy (KRT), but its uptake remains low in Japan. We evaluated whether individualized education in a dedicated outpatient clinic was associated with the initiation of PD.
Yasuko Ito   +7 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

Fair-Energy Trajectory Planning for Multi-Target Positioning Based on Cooperative Unmanned Aerial Vehicles

open access: yesIEEE Access, 2020
Owing to the flexibility and low cost, cooperative Unmanned Aerial Vehicles(UAVs) have been attractive in multi-target positioning recently. Although it is popular and easy to accomplish, positioning based on trilateration method still faces challenges ...
Yao Ji, Chao Dong, Xiaojun Zhu, Qihui Wu
doaj   +1 more source

Home - About - Disclaimer - Privacy