Sciweavers

8647 search results - page 267 / 1730
» The Container Selection Problem
Sort
View
PAMI
2010
132views more  PAMI 2010»
15 years 2 months ago
Maximum Likelihood Model Selection for 1-Norm Soft Margin SVMs with Multiple Parameters
—Adapting the hyperparameters of support vector machines (SVMs) is a challenging model selection problem, especially when flexible kernels are to be adapted and data are scarce....
Tobias Glasmachers, Christian Igel
ICASSP
2011
IEEE
14 years 7 months ago
Feature selection through gravitational search algorithm
In this paper we deal with the problem of feature selection by introducing a new approach based on Gravitational Search Algorithm (GSA). The proposed algorithm combines the optimi...
João Paulo Papa, Andre Pagnin, Silvana Arti...
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
16 years 1 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu
GECCO
2007
Springer
236views Optimization» more  GECCO 2007»
15 years 10 months ago
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
Quan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Lia...
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
15 years 9 months ago
The enhanced evolutionary tabu search and its application to the quadratic assignment problem
We describe the Enhanced Evolutionary Tabu Search (EE-TS) local search technique. The EE-TS metaheuristic technique combines Reactive Tabu Search with evolutionary computing eleme...
John F. McLoughlin III, Walter Cedeño