269 search results - page 32 / 54 » A branch and bound method for stochastic global optimization |
114
click to vote
JMLR
2012
13 years 2 months ago
2012
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
User-provided object bounding box is a simple and
popular interaction paradigm considered by many existing
interactive image segmentation frameworks. However,
these frameworks t...
89
Voted
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
— This paper presents a single-objective and a multiobjective stochastic optimization algorithms for global training of neural networks based on simulated annealing. The algorith...
108
click to vote
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
113
click to vote
JMLR
2010
14 years 6 months ago
2010
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...