Results 21 to 30 of about 285,904 (328)
Two New Modified Regularized Methods for Solving the Variational Inclusion and Null Point Problems
In this article, based on the regularization techniques, we construct two new algorithms combining the forward-backward splitting algorithm and the proximal contraction algorithm, respectively.
Yuanheng Wang +3 more
doaj +1 more source
Statistical Sources of Variable Selection Bias in Classification Tree Algorithms Based on the Gini Index [PDF]
Evidence for variable selection bias in classification tree algorithms based on the Gini Index is reviewed from the literature and embedded into a broader explanatory scheme: Variable selection bias in classification tree algorithms based on the Gini ...
Strobl, Carolin
core +2 more sources
Providing fair and convenient comparisons between recommendation algorithms—where algorithms could focus on a traditional dimension (accuracy) and/or less traditional ones (e.g., novelty, diversity, serendipity, etc.)—is a key challenge in the recent ...
François Fouss, Elora Fernandes
doaj +1 more source
Distributed Verification of Rare Properties using Importance Splitting Observers [PDF]
Rare properties remain a challenge for statistical model checking (SMC) due to the quadratic scaling of variance with rarity. We address this with a variance reduction framework based on lightweight importance splitting observers.
Jegourel, Cyrille +3 more
core +5 more sources
Distributed Real-Time Model of the M3C for HIL Systems Using Small-Scale Simulators
Hardware-in-the-loop systems are an essential tool to verify controllers and deployed control algorithms in a risk-free environment. The inaccessibility of the converters used in applications such as pumped hydro storage power plants due to their high ...
Philippe Bontemps +2 more
doaj +1 more source
A new N = 2n fast Fourier transform algorithm is presented, which has fewer multiplications and additions than radix 2n, n = 1, 2, 3 algorithms, has the same number of multiplications as the Raderi-Brenner algorithm, but much fewer additions, and is numerically better conditioned, and is performed ‘in place’ by a repetitive use of a ‘butterfly’-type ...
P. Duhamel, H. Hollmann
openaire +1 more source
Hypergraph cuts with edge-dependent vertex weights
We develop a framework for incorporating edge-dependent vertex weights (EDVWs) into the hypergraph minimum s-t cut problem. These weights are able to reflect different importance of vertices within a hyperedge, thus leading to better characterized cut ...
Yu Zhu, Santiago Segarra
doaj +1 more source
A cure for the sonic point glitch [PDF]
Among the various numerical schemes developed since the '80s for the computation of the compressible Euler equations, the vast majority produce in certain cases spurious pressure glitches at sonic points.
Gressier, Jérémie +1 more
core +1 more source
We developed mixed integer programming (MIP) models and hybrid genetic-local search algorithms for the scheduling problem of unrelated parallel machines with job sequence and machine-dependent setup times and with job splitting property.
Duygu Yilmaz Eroglu, H. Cenk Ozmutlu
doaj +1 more source
Algorithmic Approach to the Split Problems [PDF]
This paper deals with design algorithms for the split variational inequality and equilibrium problems. Strong convergence theorems are demonstrated.
openaire +3 more sources

