Sciweavers

4908 search results - page 215 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
TNN
2010
234views Management» more  TNN 2010»
15 years 1 months ago
Novel maximum-margin training algorithms for supervised neural networks
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
Oswaldo Ludwig, Urbano Nunes
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
16 years 3 days ago
Harmony search for structural design
Various algorithms have been developed and applied to structural optimization, in which cross-sectional areas of structure members are assumed to be continuous. In most cases of p...
Zong Woo Geem, Kang Seok Lee, Chung-Li Tseng
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
16 years 3 days ago
Niching in evolution strategies
Evolutionary Algorithms (EAs), popular search methods for solving search and optimization problems, are known for successful and fast location of single optimal solutions. However,...
Ofer M. Shir, Thomas Bäck
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 10 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
ICC
2009
IEEE
101views Communications» more  ICC 2009»
15 years 4 months ago
Using Limited Feedback in Power Allocation Design for a Two-Hop Relay OFDM System
In this paper, we study power allocation (PA) in a single-relay OFDM system with limited feedback. We propose a PA scheme that uses a codebook of quantized PA vectors designed offl...
Mahdi Hajiaghayi, Min Dong, Ben Liang