Sciweavers

1795 search results - page 177 / 359
» Search by strategy
Sort
View
ANOR
2004
116views more  ANOR 2004»
15 years 6 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
GECCO
2005
Springer
116views Optimization» more  GECCO 2005»
16 years 1 days ago
An empirical study on the handling of overlapping solutions in evolutionary multiobjective optimization
We focus on the handling of overlapping solutions in evolutionary multiobjective optimization (EMO) algorithms. First we show that there exist a large number of overlapping soluti...
Hisao Ishibuchi, Kaname Narukawa, Yusuke Nojima
CEC
2009
IEEE
16 years 1 months ago
Evolutionary programming with ensemble of explicit memories for dynamic optimization
—This paper presents the evolutionary programming with an ensemble of memories to deal with optimization problems in dynamic environments. The proposed algorithm modifies a recen...
Ling Yu, Ponnuthurai N. Suganthan
PR
2006
101views more  PR 2006»
15 years 6 months ago
Feature-based approach to semi-supervised similarity learning
For the management of digital document collections, automatic database analysis still has ties to deal with semantic queries and abstract concepts that users are looking for. When...
Philippe Henri Gosselin, Matthieu Cord
ICCV
2007
IEEE
16 years 8 months ago
Improving Descriptors for Fast Tree Matching by Optimal Linear Projection
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
Krystian Mikolajczyk, Jiri Matas