940 search results - page 112 / 188 » Control Abstractions for Local Search |
147
Voted
EVOW
2010
Springer
16 years 27 days ago
2010
Springer
Abstract. We revisit Gaussian Adaptation (GaA), a black-box optimizer for discrete and continuous problems that has been developed in the late 1960’s. This largely neglected sear...
187
click to vote
SEKE
2010
Springer
15 years 3 months ago
2010
Springer
Abstract--Component-based development focuses on compose and composition: abstract components (as wished) must be searched for and matched to existing component (as found). This se...
125
click to vote
CAISE
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. The translation of information between heterogeneous representations is a long standing issue. With the large spreading of cooperative applications fostered by the advent...
212
click to vote
EVOW
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
187
click to vote
SLS
2007
Springer
16 years 5 days ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...