Results 21 to 30 of about 37,831 (263)
Introducing a robust and efficient stopping criterion for MOEAs [PDF]
IEEE Congress on Evolutionary Computation, 2010 Soft computing methods, and Multi-Objective Evolutionary Algorithms (MOEAs) in particular, lack a general convergence criterion which prevents these algorithms from detecting the generation where further evolution will provide little improvements (or none at all) over the current solution, making them waste computational resources.
José Luis Guerrero +4 more
openaire +3 more sources
Simplified Early Stopping Criterion for Belief-Propagation Polar Code Decoder Based on Frozen Bits
IEEE Access, 2019 Polar codes were first proposed by E. Arıkan in 2009 and have received significant attention in recent years. Successive-cancellation (SC) and belief-propagation (BP) decoding algorithms have been applied by some researchers to polar codes ...
Yongli Yan, Xuanxuan Zhang, Bin Wu
doaj +1 more source
IEEE Access, 2021 Biomedical text classification algorithms, which currently support clinical decision-making processes, call for expensive training texts due to the low availability of labeled corpus and the cost of manual annotation by specialized professionals.
Christopher A. Flores +2 more
doaj +1 more source
IEEE Access, 2019 The Singular spectrum decomposition (SSD) method has been widely used in gearbox fault diagnosis. However, there are two defects in the SSD method. SSD method uses the normalized mean square error as the stopping criterion for decomposition, and there is
Zhijian Wang +3 more
doaj +1 more source
Simultaneous neural machine translation with a reinforced attention mechanism
ETRI Journal, 2021 To translate in real time, a simultaneous translation system should determine when to stop reading source tokens and generate target tokens corresponding to a partial source sentence read up to that point.
YoHan Lee, JongHun Shin, YoungKil Kim
doaj +1 more source
Simple Stopping Criteria for Information Theoretic Feature Selection
Entropy, 2019 Feature selection aims to select the smallest feature subset that yields the minimum generalization error. In the rich literature in feature selection, information theory-based approaches seek a subset of features such that the mutual information between
Shujian Yu, José C. Príncipe
doaj +1 more source
Optimal Reinsurance Problem under Fixed Cost and Exponential Preferences
Mathematics, 2021 We investigate an optimal reinsurance problem for an insurance company taking into account subscription costs: that is, a constant fixed cost is paid when the reinsurance contract is signed.
Matteo Brachetta, Claudia Ceci
doaj +1 more source
New stopping criterion for genetic algorithms
European Journal of Operational Research, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
The Belk College of Business Administration, MIS/OM Department, UNCC University City Building, Charlotte, NC 28223, USA ( host institution ) +2 more
openaire +4 more sources
Fixing the RANSAC Stopping Criterion
CoRRFor several decades, RANSAC has been one of the most commonly used robust estimation algorithms for many problems in computer vision and related fields. The main contribution of this paper lies in addressing a long-standing error baked into virtually any system building upon the RANSAC algorithm. Since its inception in 1981 by Fischler and Bolles, many
Johannes L. Schönberger +2 more
openaire +3 more sources
Learning a Stopping Criterion for Local Search
, 2016 Local search is a very effective technique to tackle combinatorial problems in multiple areas ranging from telecommunications to transportations, and VLSI circuit design. A local search algorithm typically explores the space of solutions until a given stopping criterion is met. Ideally, the algorithm is executed until a target solution is reached (e.g.,
Alejandro Arbelaez, Barry O'Sullivan
openaire +3 more sources