Sciweavers

2457 search results - page 139 / 492
» Local Search with Bootstrapping
Sort
View
CPC
2008
135views more  CPC 2008»
14 years 10 months ago
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
Michael Fuchs
CEC
2011
IEEE
13 years 10 months ago
On universal search strategies for multi-criteria optimization using weighted sums
—We develop a stochastic local search algorithm for finding Pareto points for multi-criteria optimization problems. The algorithm alternates between different single-criterium o...
Julien Legriel, Scott Cotton, Oded Maler
CVPR
2009
IEEE
16 years 5 months ago
Pose Search: retrieving people using their pose
We describe a method for retrieving shots containing a particular 2D human pose from unconstrained movie and TV videos. The method involves first localizing the spatial layout o...
Andrew Zisserman, Manuel J. Marín-Jim&eacut...
NN
2002
Springer
136views Neural Networks» more  NN 2002»
14 years 9 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
15 years 1 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley