Sciweavers

1177 search results - page 112 / 236
» Iterative methods for Robbins problems
Sort
View
PAKDD
2010
ACM
134views Data Mining» more  PAKDD 2010»
15 years 8 months ago
A Robust Seedless Algorithm for Correlation Clustering
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
Mohammad S. Aziz, Chandan K. Reddy
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
15 years 7 months ago
Coordinate change operators for genetic algorithms
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
Elizabeth F. Wanner, Eduardo G. Carrano, Ricardo H...
MCS
2007
Springer
15 years 6 months ago
Elasto-plasticity model in structural optimization of composite materials with periodic microstructures
The paper deals with a structural optimization of composite materials with periodic microstructures invoking an elasto-plasticity model with the von Mises yield criterion. Closest...
Ronald H. W. Hoppe, Svetozara Petrova
PRL
2011
15 years 1 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino
LCPC
2000
Springer
15 years 10 months ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips