119 search results - page 16 / 24 » A relaxed approach to combinatorial problems in robustness a... |
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
This research uses a Design of Experiments (DOE) approach to build a predictive model of the performance of a combinatorial optimization heuristic over a range of heuristic tuning...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
TSMC
2008
13 years 8 months ago
2008
Abstract--This paper addresses the problem of 3-D reconstruction of nonrigid objects from uncalibrated image sequences. Under the assumption of affine camera and that the nonrigid ...
CP
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Stochastic Local Search (SLS) is a simple and effective paradigm for attacking a variety of Combinatorial (Optimization) Problems (COP). However, it is often non-trivial...
SDM
2010
SIAM
13 years 7 months ago
2010
SIAM
A popular approach for dimensionality reduction and data analysis is principal component analysis (PCA). A limiting factor with PCA is that it does not inform us on which of the o...