577 search results - page 85 / 116 » New interval methods for constrained global optimization |
133
click to vote
CGF
2000
15 years 3 months ago
2000
This paper presents a new technique called motion balance filtering, which corrects an unbalanced motion to a balanced one while preserving the original motion characteristics as ...
156
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
Abstract. This article presents a new open-source C++ implementation to solve the SLAM problem, which is focused on genericity, versatility and high execution speed. It is based on...
164
Voted
CEC
2011
IEEE
14 years 3 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
313
Voted
PAMI
2010
15 years 2 months ago
2010
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
167
Voted
SIAMIS
2010
14 years 10 months ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...