Buscar
Mostrando ítems 51-60 de 46958
Automatic Design of Decision-Tree Algorithms with Evolutionary Algorithms
(Mit Press, 2013-11-01)
This study reports the empirical analysis of a hyper-heuristic evolutionary algorithm that is capable of automatically designing top-down decision-tree induction algorithms. Top-down decision-tree algorithms are of great ...
Solving multicommodity flow problems by an approximation scheme
(SIAM PUBLICATIONS, 2005)
We study an approximation scheme to solve minimum cost multicommodity flow problems to a relative accuracy of epsilon is an element of (0, 1]. The proposed scheme, which we shall call Algorithm A, is a bisection-based ...
PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH
(EDP SCIENCES S A, 2010)
We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without ...
Heuristic feasibility and preprocessing for a set covering solver based on firefly optimization
(Springer Verlag, 2015)
Another prefiltering algorithm for adaptive IIR filtering
(1995-12-01)
An algorithm for adaptive IIR filtering that uses prefiltering structure in direct form is presented. This structure has an estimation error that is a linear function of the coefficients. This property greatly simplifies ...
Another prefiltering algorithm for adaptive IIR filtering
(1995-12-01)
An algorithm for adaptive IIR filtering that uses prefiltering structure in direct form is presented. This structure has an estimation error that is a linear function of the coefficients. This property greatly simplifies ...
Algorithm for Construction of Phylogenetic Trees
(1989)
An algorithm is described for the construction of phylogenetic trees. The algorithm is based on the progressive correction of data along the tree construction. For the correction, the average value of the difference between ...
Terminal Triangles Centroid Algorithms for Quality Delaunay Triangulation
(Elsevier, 2020)
Two Lepp algorithms for quality Delaunay triangulation are discussed. Firstly a terminal triangles centroid Delaunay algorithm is studied. For each bad quality triangle t, the algorithm uses the longest edge propagating ...
General subpopulation framework and taming the conflict inside populations
(MIT PressCambridge, Mass, 2015)
Structured evolutionary algorithms have been investigated for some time. However,
they have been under explored especially in the field of multi-objective optimization.
Despite good results, the use of complex dynamics ...
A Fukui function-guided genetic algorithm. Assessment on structural prediction of Sin (n = 12–20) clusters
(John Wiley and Sons Inc., 2017)