Sciweavers

269 search results - page 1 / 54
» A branch and bound method for stochastic global optimization
Sort
View
MP
1998
61views more  MP 1998»
13 years 5 months ago
A branch and bound method for stochastic global optimization
Vladimir I. Norkin, Georg Ch. Pflug, Andrezj Ruszc...
ICAART
2010
INSTICC
14 years 2 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
4OR
2006
99views more  4OR 2006»
13 years 5 months ago
A decomposition-based solution method for stochastic mixed integer nonlinear programs
This is a summary of the main results presented in the author's PhD thesis, supervised by D. Conforti and P. Beraldi and defended on March 2005. The thesis, written in English...
Maria Elena Bruni
ICCV
2011
IEEE
12 years 5 months ago
Optimal Landmark Detection using Shape Models and Branch and Bound
Fitting statistical 2D and 3D shape models to images is necessary for a variety of tasks, such as video editing and face recognition. Much progress has been made on local fitting...
Brian Amberg, Thomas Vetter
AMC
2008
88views more  AMC 2008»
13 years 5 months ago
Stopping rules for box-constrained stochastic global optimization
We present three new stopping rules for Multistart based methods. The first uses a device that enables the determination of the coverage of the bounded search domain. The second i...
Isaac E. Lagaris, Ioannis G. Tsoulos