Sciweavers

2570 search results - page 220 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
AE
2005
Springer
15 years 9 months ago
Memetic Algorithms for the MinLA Problem
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA ...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
ICGA
1997
133views Optimization» more  ICGA 1997»
15 years 5 months ago
Messy Genetic Algorithms for Subset Feature Selection
Subset Feature Selection problems can have severalattributes which may make Messy Genetic Algorithms an appropriateoptimization method. First, competitive solutions may often use ...
L. Darrell Whitley, J. Ross Beveridge, Cesar Guerr...
SDM
2008
SIAM
133views Data Mining» more  SDM 2008»
15 years 5 months ago
A RELIEF Based Feature Extraction Algorithm
RELIEF is considered one of the most successful algorithms for assessing the quality of features due to its simplicity and effectiveness. It has been recently proved that RELIEF i...
Yijun Sun, Dapeng Wu
168
Voted
ICRA
1995
IEEE
188views Robotics» more  ICRA 1995»
15 years 7 months ago
Fast Approximation of Range Images by Triangular Meshes Generated through Adaptive Randomized Sampling
This paper describes and evaluates an efficient technique that allows the fast generation of 3D triangular meshes from range images avoiding optimization procedures. Such a tool ...
Miguel Angel García
JMLR
2006
124views more  JMLR 2006»
15 years 4 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini