16082 search results - page 69 / 3217 » Fireworks Algorithm for Optimization |
155
click to vote
AIR
2002
15 years 2 months ago
2002
The rapid advances of evolutionary methods for multi-objective (MO) optimization poses the difficulty of keeping track of the developments in this field as well as selecting an app...
132
click to vote
MP
2010
14 years 9 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
159
Voted
OL
2011
14 years 9 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
113
click to vote
TOC
2008
15 years 2 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
151
click to vote
APBC
2008
15 years 3 months ago
2008
: Finding motifs and the corresponding binding sites is a critical and challenging problem in studying the process of gene expression. String and matrix representations are two pop...