2280 search results - page 334 / 456 » Global Optimization for Optimal Generalized Procrustes Analy... |
127
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
136
Voted
WAOA
2004
Springer
15 years 10 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
118
click to vote
COMPGEOM
2003
ACM
15 years 9 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
137
click to vote
SAC
2003
ACM
15 years 9 months ago
2003
ACM
Traditional design and implementation of large atmospheric models is a difficult, tedious and error prone task. With the CTADEL project we investigate a new method of code genera...
141
Voted
DATE
2010
IEEE
15 years 9 months ago
2010
IEEE
The release of general purpose GPU programming environments has garnered universal access to computing performance that was once only available to super-computers. The availability...