Results 231 to 240 of about 332,730 (283)
Some of the next articles are maybe not open access.
Heuristic Clustering Algorithms
2020This chapter is devoted to the most popular heuristic partitional clustering algorithms such as k-means, k-medians, and k-medoids. In addition, we give an overview of some clustering algorithms based on mixture models, self-organizing map, and fuzzy clustering. The description of these algorithms as well as their flowcharts is presented.
Adil Bagirov +2 more
openaire +1 more source
Heuristics and Genetic Algorithms
INCOSE International Symposium, 2006AbstractGenetic algorithms are design tools used in generating optimal solutions. While they can often be shown to outperform various heuristic methods and hybrid approaches, using a combination of evolutionary algorithms and heuristic approaches can generate an optimal solution more quickly than either of the two methods independently.
Michael D. Mobley +2 more
openaire +1 more source
A heuristic triangulation algorithm
Journal of Algorithms, 1987We propose a heuristic triangulation algorithm. The algorithm runs in polynomial time and produces a triangulation within a ratio of O(log n) to the cost of an optimal triangulation of a set of n points in the Euclidean plane.
Plaisted, David A., Hong, Jiarong
openaire +1 more source
On Fast Heuristic Non-deterministic Algorithms and Short Heuristic Proofs [PDF]
Fundamenta Informaticae, 2014 In this paper we study heuristic proof systems and heuristic non-deterministic algorithms. We give an example of a language Y and a polynomial-time samplable distribution D such that the distributional problem (Y, D) belongs to the complexity class HeurNP but Y ∉ NP if NP ≠ coNP, and (Y, D) ∉ HeurBPP if (NP,PSamp) $\nsubseteq$ HeurBPP. For a language L
Itsykson, Dmitry, Sokolov, Dmitry
openaire +1 more source
Optimization of Chemical Synthesis with Heuristic Algorithms
SSRN Electronic Journal, 2022Heuristic algorithms have been used in optimizing cross-coupling yields.
Jialu Chen, Wenjun Xu, Ruiqin Zhang
openaire +2 more sources
Algorithms, approximations, and heuristics
2001This chapter, indeed the whole of this book, is based on three axioms: 1. Machine vision is an engineering discipline, not a mathematical or philosophical exercise. 2. There is no unique way to perform any given image-processing function; every algorithm can be implemented in many different ways. 3.
Bruce Batchelor, Frederick Waltz
openaire +1 more source
An Improved Bidirectional Heuristic Search Algorithm
Journal of the ACM, 1977A modification of Pohl's bidirectional heuristic search algorithm is described together with a simplified implementation. Theorems are proved about conditions yielding shortest paths. The results are given of a worst-case analysis of different algorithms, suggesting a rank order of their quality.
de Champeaux, Dennis, Sint, Lenie
openaire +1 more source
2017 Seventh International Conference on Innovative Computing Technology (INTECH), 2017
Metaheuristic algorithms (MH's) are referred to algorithms which has a two-level design — ‘meta’ is upper-level procedure that controls the underlying ‘heuristic’ which learns and improves a solution iteratively until a sufficiently good solution is obtained for an optimization problem.
openaire +1 more source
Metaheuristic algorithms (MH's) are referred to algorithms which has a two-level design — ‘meta’ is upper-level procedure that controls the underlying ‘heuristic’ which learns and improves a solution iteratively until a sufficiently good solution is obtained for an optimization problem.
openaire +1 more source
2013
In this chapter a new optimization method is presented, called the Heuristic Kalman Algorithm (HKA). This new algorithm is proposed as an alternative approach for solving continuous non-convex optimization problems. The principle of HKA is to consider explicitly the optimization problem as a measurement process intended to give an estimate of the ...
openaire +1 more source
In this chapter a new optimization method is presented, called the Heuristic Kalman Algorithm (HKA). This new algorithm is proposed as an alternative approach for solving continuous non-convex optimization problems. The principle of HKA is to consider explicitly the optimization problem as a measurement process intended to give an estimate of the ...
openaire +1 more source
Heuristic Algorithms for Single Row Routing
IEEE Transactions on Computers, 1987A heuristic algorithm, based on the criterion of having nets with larger cut numbers assigned to inner tracks and nets with smaller cut numbers assigned to outer tracks, for single row routing problem has recently been proposed by Tarng et al. It has been reported that this algorithm has always been able to produce the optimal solutions for all the ...
Du, David Hung-Chang, Liu, Lee-Chin Hsu
openaire +1 more source