Sciweavers

223 search results - page 20 / 45
» Approximate local search in combinatorial optimization
Sort
View
ECML
2007
Springer
14 years 1 months ago
Optimizing Feature Sets for Structured Data
Choosing a suitable feature representation for structured data is a non-trivial task due to the vast number of potential candidates. Ideally, one would like to pick a small, but in...
Ulrich Rückert, Stefan Kramer
GLOBECOM
2009
IEEE
13 years 5 months ago
A Reactive Tabu Search Based Equalizer for Severely Delay-Spread UWB MIMO-ISI Channels
We propose a novel equalizer for ultrawideband (UWB) multiple-input multiple-output (MIMO) channels characterized by severe delay spreads. The proposed equalizer is based on reacti...
N. Srinidhi, Saif K. Mohammed, Ananthanarayanan Ch...
HEURISTICS
2008
120views more  HEURISTICS 2008»
13 years 7 months ago
A local linear embedding module for evolutionary computation optimization
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
Fabio Boschetti
JCO
2007
123views more  JCO 2007»
13 years 7 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
JMLR
2006
145views more  JMLR 2006»
13 years 7 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street