Sciweavers

1171 search results - page 51 / 235
» Variable neighborhood search
Sort
View
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
15 years 3 months ago
Latent variable crossover for k-tablet structures and its application to lens design problems
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
Jun Sakuma, Shigenobu Kobayashi
IMECS
2007
14 years 11 months ago
Knowledge Acquisition from Computer Log Files by ADG with Variable Agent Size
Abstract—We had previously proposed an outstanding evolutionary method, Automatically Defined Groups (ADG), for generating heterogeneous cooperative agents, and then we had deve...
Akira Hara, Yoshiaki Kurosawa, Takumi Ichimura
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 3 months ago
Search space modulation in genetic algorithms: evolving the search space by sinusoidal transformations
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into...
José Antonio Martin H.
DATAMINE
2000
118views more  DATAMINE 2000»
14 years 9 months ago
Spatial Data Mining: Database Primitives, Algorithms and Efficient DBMS Support
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
Martin Ester, Alexander Frommelt, Hans-Peter Krieg...
78
Voted
ICPR
2002
IEEE
15 years 10 months ago
Metric-Based Shape Retrieval in Large Databases
This paper examines the problem of database organization and retrieval based on computing metric pairwise distances. A low-dimensional Euclidean approximation of a high-dimensiona...
Thomas B. Sebastian, Benjamin B. Kimia