Results 31 to 40 of about 1,195,901 (281)
Optimization of machine learning algorithms for proteomic analysis using topsis
Журнал інженерних наук, 2022 The present study focuses on a new application of the TOPSIS method for the optimization of machine learning algorithms, supervised neural networks (SNN), the quick classifier (QC), and genetic algorithm (GA) for proteomic analysis.
Javanbakht T., Chakravorty S.
doaj +1 more source
A constrained multi-objective surrogate-based optimization algorithm [PDF]
, 2014 Surrogate models or metamodels are widely used in the realm of engineering for design optimization to minimize the number of computationally expensive simulations.
Couckuyt, Ivo +3 more
core +1 more source
Explicit memory schemes for evolutionary algorithms in dynamic environments [PDF]
, 2007 Copyright @ 2007 Springer-VerlagProblem optimization in dynamic environments has atrracted a growing interest from the evolutionary computation community in reccent years due to its importance in real world optimization problems.
D Dasgupta +13 more
core +3 more sources
Leanness Computation: Small Values and Special Graph Classes [PDF]
Discrete Mathematics & Theoretical Computer ScienceLet u and v be vertices in a connected graph G = (V, E). For any integer k such that 0 ≤ k ≤ dG (u, v), the k-slice Sk (u, v) contains all vertices x on a shortest uv-path such that dG (u, x) = k.
David Coudert +2 more
doaj +1 more source
Niching genetic algorithms for optimization in electromagnetics. I. Fundamentals [PDF]
, 1998 Niching methods extend genetic algorithms and permit the investigation of multiple optimal solutions in the search space. In this paper, we review and discuss various strategies of niching for optimization in electromagnetics.
Krähenbühl, Laurent +2 more
core +3 more sources
Mathematics, 2022 This article considers a box-constrained global optimization problem for Lipschitz continuous functions with an unknown Lipschitz constant. The well-known derivative-free global search algorithm DIRECT (DIvide RECTangle) is a promising approach for such ...
Linas Stripinis, Remigijus Paulavičius
doaj +1 more source
Bregman Monotone Optimization Algorithms [PDF]
SIAM Journal on Control and Optimization, 2003 Summary: A broad class of optimization algorithms based on Bregman distances in Banach spaces is unified around the notion of Bregman monotonicity. A systematic investigation of this notion leads to a simplified analysis of numerous algorithms and to the development of a new class of parallel block-iterative surrogate Bregman projection schemes ...
Bauschke, Heinz H. +2 more
openaire +1 more source
Pushing Vertices to Make Graphs Irregular [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn connection with the so-called 1-2-3 Conjecture, we introduce and study a new problem related to proper labellings. In the regular problem, proper labellings of graphs are designed by assigning strictly positive labels to the edges so that any two ...
Julien Bensmail +2 more
doaj +1 more source
Optimizing the Trickle Algorithm [PDF]
IEEE Communications Letters, 2015 The Trickle Algorithm has enjoyed much popularity and widespread use as a basic network primitive ensuring low-cost data consistency in lossy networks. Trickle is shaped by the so-called short-listen problem, hence the imposition of a listen-only period.
Djamaa, Badis, Richardson, Mark A.
openaire +2 more sources
A Comparative Study on the Use of Classification Algorithms in Financial Forecasting [PDF]
, 2014 Financial forecasting is a vital area in computational finance, where several studies have taken place over the years. One way of viewing financial forecasting is as a classification problem, where the goal is to find a model that represents the ...
F Otero, J Koza, S García, SH Chen
core +1 more source