Sciweavers

2244 search results - page 298 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
SDM
2010
SIAM
168views Data Mining» more  SDM 2010»
15 years 5 months ago
Convex Principal Feature Selection
A popular approach for dimensionality reduction and data analysis is principal component analysis (PCA). A limiting factor with PCA is that it does not inform us on which of the o...
Mahdokht Masaeli, Yan Yan, Ying Cui, Glenn Fung, J...
211
Voted
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
15 years 7 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
16 years 7 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
DATE
2007
IEEE
144views Hardware» more  DATE 2007»
16 years 1 months ago
Adaptive power management in energy harvesting systems
Recently, there has been a substantial interest in the design of systems that receive their energy from regenerative sources such as solar cells. In contrast to approaches that at...
Clemens Moser, Lothar Thiele, Davide Brunelli, Luc...
JGO
2010
121views more  JGO 2010»
15 years 5 months ago
The oracle penalty method
A new and universal penalty method is introduced in this contribution. It is especially intended to be applied in stochastic metaheuristics like genetic algorithms, particle swarm...
Martin Schlüter, Matthias Gerdts