Sciweavers

15485 search results - page 2610 / 3097
» Computing Optimal Subsets
Sort
View
SIGIR
2005
ACM
16 years 17 days ago
Orthogonal locality preserving indexing
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
Deng Cai, Xiaofei He
ECML
2005
Springer
16 years 16 days ago
Kernel Basis Pursuit
ABSTRACT. Estimating a non-uniformly sampled function from a set of learning points is a classical regression problem. Kernel methods have been widely used in this context, but eve...
Vincent Guigue, Alain Rakotomamonjy, Stépha...
GECCO
2005
Springer
182views Optimization» more  GECCO 2005»
16 years 16 days ago
Improving EAX with restricted 2-opt
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
Chen-hsiung Chan, Sheng-An Lee, Cheng-Yan Kao, Hua...
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
16 years 16 days 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
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
16 years 16 days ago
Using evolutionary algorithms for the unit testing of object-oriented software
As the paradigm of object orientation becomes more and more important for modern IT development projects, the demand for an automated test case generation to dynamically test obje...
Stefan Wappler, Frank Lammermann
« Prev « First page 2610 / 3097 Last » Next »