Buscar
Mostrando ítems 1-10 de 7239
Recent harmony search algorithms for 0–1 optimization problems
(Springer Verlag, 2015)
A FAST ALGORITHM ON AVERAGE FOR ALL-AGAINST-ALL SEQUENCE MATCHING
(IEEE TECHNICAL COMMITTEE ON DATA ENGINEERING, 1999)
We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. ...
An enhanced genetic algorithm to solve the static and multistage transmission network expansion planning
(2012-04-23)
An enhanced genetic algorithm (EGA) is applied to solve the long-term transmission expansion planning (LTTEP) problem. The following characteristics of the proposed EGA to solve the static and multistage LTTEP problem are ...
An enhanced genetic algorithm to solve the static and multistage transmission network expansion planning
(2012-04-23)
An enhanced genetic algorithm (EGA) is applied to solve the long-term transmission expansion planning (LTTEP) problem. The following characteristics of the proposed EGA to solve the static and multistage LTTEP problem are ...
On the solution of mathematical programming problems with equilibrium constraints
(2002-02-01)
Mathematical programming problems with equilibrium constraints (MPEC) are nonlinear programming problems where the constraints have a form that is analogous to first-order optimality conditions of constrained optimization. ...
On the solution of mathematical programming problems with equilibrium constraints
(2002-02-01)
Mathematical programming problems with equilibrium constraints (MPEC) are nonlinear programming problems where the constraints have a form that is analogous to first-order optimality conditions of constrained optimization. ...
Online control of enumeration strategies via bat-inspired optimization
(Springer Verlag, 2015)
Hybrid algorithms for solving Sudokus [Algoritmos híbridos para la resolución de Sudokus]
(Institute of Electrical and Electronics Engineers Inc., 2015)