Results 51 to 60 of about 1,005,063 (328)
Nonparametric Approximation Strategy Iteration Parallel Reinforcement Learning Algorithm [PDF]
Jisuanji gongcheng, 2018 To solve the problem of slow convergence speed of the online approximation strategy iteration reinforcement learning algorithm,a nonparametric approximation strategy iteration parallel reinforcement learning algorithm is proposed.The number of parallel ...
JI Ting,ZHANG Hua
doaj +1 more source
, 2018 This paper is concerned with the approximation of tensors using tree-based tensor formats, which are tensor networks whose graphs are dimension partition trees. We consider Hilbert tensor spaces of multivariate functions defined on a product set equipped
Nouy, Anthony
core +2 more sources
Algorithms For Positive Polynomial Approximation [PDF]
SIAM Journal on Numerical Analysis, 2019 Summary: We propose several algorithms for positive polynomial approximation. The main tool is a novel iterative method to compute nonnegative interpolation polynomials at any order, which is shown to converge under conditions that make it suitable for the numerical approximation of positive functions. Our method is based on the special representations
Charles, Frédérique +2 more
openaire +2 more sources
Liquid biopsy epigenetics: establishing a molecular profile based on cell‐free DNA
Molecular Oncology, EarlyView.Cell‐free DNA (cfDNA) fragments in plasma from cancer patients carry epigenetic signatures reflecting their cells of origin. These epigenetic features include DNA methylation, nucleosome modifications, and variations in fragmentation. This review describes the biological properties of each feature and explores optimal strategies for harnessing cfDNA ...
Christoffer Trier Maansson +2 more
wiley +1 more source
Approximation of Queues in Bike-Sharing Systems With Finite Docks
Promet (Zagreb)This paper presents a closed queuing network model to address bike queues in bike-sharing systems with finite docks. The model tackles issues of bike spillover and user attrition due to fully occupied docks and bike shortages at stations.
Xiang PENG, Jingyan WANG, Yong ZHANG
doaj +1 more source
Improving Christofides' Algorithm for the s-t Path TSP [PDF]
, 2011 We present a deterministic (1+sqrt(5))/2-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric metric cost on n vertices including two prespecified endpoints, the problem is to find a shortest Hamiltonian path between ...
An, Hyung-Chan +2 more
core
Almost-Tight Distributed Minimum Cut Algorithms
, 2014 We study the problem of computing the minimum cut in a weighted distributed message-passing networks (the CONGEST model). Let $\lambda$ be the minimum cut, $n$ be the number of nodes in the network, and $D$ be the network diameter.
A. Das Sarma +13 more
core +1 more source
Molecular Oncology, EarlyView.HDAC4 is degraded by the E3 ligase FBXW7. In colorectal cancer, FBXW7 mutations prevent HDAC4 degradation, leading to oxaliplatin resistance. Forced degradation of HDAC4 using a PROTAC compound restores drug sensitivity by resetting the super‐enhancer landscape, reprogramming the epigenetic state of FBXW7‐mutated cells to resemble oxaliplatin ...
Vanessa Tolotto +13 more
wiley +1 more source
Mathematics, 2021 In this paper, we consider parallel-machine scheduling with release times and submodular penalties (P|rj,reject|Cmax+π(R)), in which each job can be accepted and processed on one of m identical parallel machines or rejected, but a penalty must paid if a ...
Wencheng Wang, Xiaofei Liu
doaj +1 more source
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More
, 2017 We consider questions that arise from the intersection between the areas of polynomial-time approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms.
Chalermsook, Parinya +6 more
core +1 more source