Sciweavers

34 search results - page 4 / 7
» When and Why Ruppert's Algorithm Works
Sort
View
GECCO
2005
Springer
116views Optimization» more  GECCO 2005»
14 years 28 days ago
On identifying global optima in cooperative coevolution
When applied to optimization problems, Cooperative Coevolutionary Algorithms (CCEA) have been observed to exhibit a behavior called relative overgeneralization. Roughly, they tend...
Anthony Bucci, Jordan B. Pollack
PPAM
2007
Springer
14 years 1 months ago
The Relevance of New Data Structure Approaches for Dense Linear Algebra in the New Multi-Core / Many Core Environments
For about ten years now, Bo K˚agstr¨om’s Group in Umea, Sweden, Jerzy Wa´sniewski’s Team at Danish Technical University in Lyngby, Denmark, and I at IBM Research in Yorktown...
Fred G. Gustavson
GBRPR
2005
Springer
14 years 28 days ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
Tibério S. Caetano, Terry Caelli
NIPS
1996
13 years 8 months ago
Combinations of Weak Classifiers
To obtain classification systems with both good generalizat`ion performance and efficiency in space and time, we propose a learning method based on combinations of weak classifiers...
Chuanyi Ji, Sheng Ma
CGF
2008
94views more  CGF 2008»
13 years 7 months ago
Statistical optimization of octree searches
This work emerged from the following observation: usual search procedures for octrees start from the root to retrieve the data stored at the leaves. But since the leaves are the fa...
Rener Castro, Thomas Lewiner, Hélio Lopes, ...