Sciweavers

1041 search results - page 159 / 209
» Randomizing Reductions of Search Problems
Sort
View
ICANNGA
2007
Springer
161views Algorithms» more  ICANNGA 2007»
13 years 11 months ago
Evolutionary Induction of Decision Trees for Misclassification Cost Minimization
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
Marek Kretowski, Marek Grzes
CDC
2008
IEEE
172views Control Systems» more  CDC 2008»
13 years 9 months ago
Convex relaxation approach to the identification of the Wiener-Hammerstein model
In this paper, an input/output system identification technique for the Wiener-Hammerstein model and its feedback extension is proposed. In the proposed framework, the identificatio...
Kin Cheong Sou, Alexandre Megretski, Luca Daniel
NIPS
2004
13 years 9 months ago
Euclidean Embedding of Co-Occurrence Data
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
Amir Globerson, Gal Chechik, Fernando C. Pereira, ...
ECCC
2006
97views more  ECCC 2006»
13 years 7 months ago
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...
Frank Neumann, Carsten Witt
PRL
2006
139views more  PRL 2006»
13 years 7 months ago
Evolving color constancy
Objects retain their color in spite of changes in the wavelength and energy composition of the light they reflect. This phenomenon is called color constancy and plays an important ...
Marc Ebner