5331 search results - page 682 / 1067 » Algebraic Methods for Optimization Problems |
185
click to vote
GECCO
2007
Springer
16 years 29 days ago
2007
Springer
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
172
click to vote
GECCO
2007
Springer
16 years 29 days ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
197
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We consider the problem of learning a sparse multi-task regression, where the structure in the outputs can be represented as a tree with leaf nodes as outputs and internal nodes a...
143
click to vote
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
Optimum subwindow search for object detection aims to find a subwindow so that the contained subimage is most similar to the query object. This problem can be formulated as a fou...
174
click to vote
JAIR
2007
15 years 6 months ago
2007
A pattern database (PDB) is a heuristic function implemented as a lookup table that stores the lengths of optimal solutions for subproblem instances. Standard PDBs have a distinct...