Results 11 to 20 of about 149 (149)
A proof algorithm associated with the dipole splitting algorithm [PDF]
Progress of Theoretical and Experimental Physics, 2015 86 pages, 9 ...
openaire +3 more sources
Algorithmic Splitting: A Method for Dataset Preparation [PDF]
IEEE Access, 2021 The datasets that appear in publications are curated and have been split into training, testing and validation sub-datasets by domain experts. Consequently, machine learning models typically perform well on such split-by-hand prepared datasets. Whereas preparing real-world datasets into curated split training, testing and validation sub-dataset ...
Khalid M. Kahloot, Peter Ekler
openaire +3 more sources
A Fusion Multiobjective Empire Split Algorithm [PDF]
Journal of Control Science and Engineering, 2020 In the last two decades, swarm intelligence optimization algorithms have been widely studied and applied to multiobjective optimization problems. In multiobjective optimization, reproduction operations and the balance of convergence and diversity are two crucial issues.
openaire +2 more sources
Split-Douglas--Rachford Algorithm for Composite Monotone Inclusions and Split-ADMM [PDF]
SIAM Journal on Optimization, 2021 26 ...
Luis M. Bricen͂o-Arias +1 more
openaire +3 more sources
Algorithms for unipolar and generalized split graphs
Discrete Applied Mathematics, 2014 Please cite this article in press as: E.M. Eschen, X. Wang, Algorithms for unipolar and generalized split graphs.
Xiaoqiang Wang, Elaine M. Eschen
openaire +3 more sources
Algorithms for the Split Variational Inequality Problem [PDF]
Numerical Algorithms, 2011 We propose a prototypical Split Inverse Problem (SIP) and a new variational problem, called the Split Variational Inequality Problem (SVIP), which is a SIP. It entails finding a solution of one inverse problem (e.g., a Variational Inequality Problem (VIP)), the image of which under a given bounded linear transformation is a solution of another inverse ...
Aviv Gibali, Simeon Reich, Yair Censor
openaire +3 more sources
Algorithms for deletion problems on split graphs [PDF]
Information Processing Letters, 2021 In the Split to Block Vertex Deletion and Split to Threshold Vertex Deletion problems the input is a split graph $G$ and an integer $k$, and the goal is to decide whether there is a set $S$ of at most $k$ vertices such that $G-S$ is a block graph and $G-S$ is a threshold graph, respectively.
openaire +3 more sources
The Splitting Algorithm for Egyptian Fractions
Journal of Number Theory, 1993 AbstractThe purpose of this paper is to answer a question raised by Stewart in 1964; we prove that the so-called splitting algorithm for Egyptian fractions based on the identity 1/x = 1/(x + 1) + 1/x(x + 1) terminates.
openaire +2 more sources
On the convergence rates of proximal splitting algorithms [PDF]
2014 IEEE International Conference on Image Processing (ICIP), 2014 In this work, we first provide iteration-complexity bounds (pointwise and ergodic) for the inexact Krasnosel'ski-Mann iteration built from nonexpansive operators. Moreover, under an appropriate regularity assumption on the fixed point operator, local linear convergence rate is also established.
Liang, Jingwei +2 more
openaire +3 more sources
A fast and stable algorithm for splitting polynomials
Computers & Mathematics with Applications, 1997 AbstractThis paper concerns the fast numerical factorization of degree a + b polynomials in a neighborhood of the polynomial xa. We want to obtain the so-called splitting of one such polynomial, i.e., a degree a factor with roots close to zero and a degree b factor with roots close to infinity.
Jorge P. Zubelli, Gregorio Malajovich
openaire +2 more sources