30 search results - page 4 / 6 » On a Global Complexity Bound of the Levenberg-Marquardt Meth... |
CP
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
VLSID
2003
IEEE
14 years 9 months ago
2003
IEEE
A formal synthesis method for complex real-time embedded software is proposed in this work. Compared to previous work, our method not only synthesizes embedded software with compl...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
SIAMJO
2008
13 years 8 months ago
2008
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
SMA
2009
ACM
14 years 3 months ago
2009
ACM
Collision detection in geometrically complex scenes is crucial in physical simulations and real time applications. Works based on spatial hierarchical structures have been propose...