Pedroso, J.P.: Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming. In: Stützle, T., Birattari, M., H. Hoos, H. (eds.) SLS 2007. LNCS, vol. 4638, pp. 217–221. Springer, Heidelberg (
Second, it is implemented for migration to maintain diversity in the set of feasible solutions. The proposed method applies a mutation strategy by perturbing the genes heuristically and seeking a better one, which introduces parallelism and makes the algorithm greedy for a better solution. The gree...
B. Kalantari, A simple polynomial time algorithm for a convex hull problem equivalent to linear programming, Combinatorics Advances, Kluwer Academic Pub., 1995, to appear.B. Kalantari, A simple polynomial time algorithm for a convex hull problem equivalent to linear programming, Combinatorics Advances...
The simplest method to implement an HVG algorithm is based on the idea of checking for each of the n data points of the time series whether it can see the remaining n−1 data points. Since the visibility property is symmetrical, the number of checks could be halved. But with n(n−...
in applications such as image search it is not necessary to return the point that is nearest to the query point; a set of well chosen near neighbors may suffice. This gives the algorithm designer considerable freedom to trade off approximation error for search complexity. This problem can be ...
simple algorithm for generating compact binary representations of imagery data, based on random projections. Our analysis gives the first explicit bound on the number of bits needed to effectively solve the indexing problem. When applied to real image search tasks, these theoretical improvements ...
The key to search for. Return Value Returns the index of the key if found, otherwise returns -1. CSimpleMap::FindVal Finds a specific value. int FindVal(const TVal& val) const; Parameters val The value for which to search. Return Value ...
Here, we describe a more efficient algorithm, directly targeting the optimization of the conditional likelihood. This algorithm is based on the IRLS (iteratively reweighted least squares) algorithm [20], which is widely used for estimating generalized linear models, and which can be applied with Las...
As an application we present a linear time algorithm to compute the diameter of a simple rectilinear polygon w.r.t. the L1-metric. Keywords: Simple rectilinear polygons; shortest path query; L1-metric; rectilinear link metric Cited by (5): Avijit Sarkar, Rajan Batta, Rakesh Nagi. (2009) ...
Approximate expressions for mathematical constants from PSLQ algorithm: a simple approach and a case studyMathematics - Number TheoryMathematics - History and Overview11Y3511Y6011M06In this note, I present a simple PSLQ code for finding null linear combinations, with the best rational coefficients,...