Sciweavers

1839 search results - page 154 / 368
» Feature Selection in Clustering Problems
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
Artificial bandwidth extension of spectral envelope with temporal clustering
We present a new wideband spectral envelope estimation framework for the artificial bandwidth extension problem. The proposed framework builds temporal clusters of the joint sub-...
Can Yagli, Engin Erzin
HEURISTICS
1998
252views more  HEURISTICS 1998»
13 years 10 months ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
P. C. Chu, J. E. Beasley
DAC
1999
ACM
14 years 11 months ago
Optimization-Intensive Watermarking Techniques for Decision Problems
Recently, a number of watermarking-based intellectual property protection techniques have been proposed. Although they have been applied to different stages in the design process ...
Gang Qu, Jennifer L. Wong, Miodrag Potkonjak
SAC
2004
ACM
14 years 3 months ago
An improved hybrid genetic algorithm for the generalized assignment problem
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
Harald Feltl, Günther R. Raidl
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
14 years 1 months ago
The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
Janusz Wojtusiak, Ryszard S. Michalski