Sciweavers

6142 search results - page 558 / 1229
» The Complexity of Partition Functions
Sort
View
182
Voted
EVOW
2008
Springer
15 years 8 months ago
A Study of Some Implications of the No Free Lunch Theorem
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
Andrea Valsecchi, Leonardo Vanneschi
SCS
2004
15 years 8 months ago
COTS - Size Does Matter
Railways, like a lot of industries are becoming increasingly reliant on programmable technology for safety. The development of railway technology is however largely driven through...
George Nikandros
VMV
2003
151views Visualization» more  VMV 2003»
15 years 8 months ago
Optimized Spatial Hashing for Collision Detection of Deformable Objects
We propose a new approach to collision and self– collision detection of dynamically deforming objects that consist of tetrahedrons. Tetrahedral meshes are commonly used to repre...
Matthias Teschner, Bruno Heidelberger, Matthias M&...
198
Voted
CEC
2010
IEEE
15 years 7 months ago
Towards scalability in niching methods
— The scaling properties of multimodal optimization methods have seldom been studied, and existing studies often concentrated on the idea that all local optima of a multimodal fu...
Marcel Kronfeld, Andreas Zell

Publication
4052views
17 years 8 months ago
On the Extraction of Curve Skeletons using Gradient Vector Flow
In this paper, we propose a new variational framework for computing continuous curve skeletons from discrete objects that are suitable for structural shape representation. We have...
M. Sabry Hassouna, Aly A. Farag