269 search results - page 40 / 54 » A branch and bound method for stochastic global optimization |
UAI
2001
14 years 11 months ago
2001
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
78
Voted
NIPS
2001
14 years 11 months ago
2001
Policy gradient methods for reinforcement learning avoid some of the undesirable properties of the value function approaches, such as policy degradation (Baxter and Bartlett, 2001...
ACCV
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Intensity based registration methods, such as the mutual information (MI), do not commonly consider the spatial geometric information and the initial correspondences are ...
128
Voted
ICDAR
2009
IEEE
14 years 7 months ago
2009
IEEE
The paper describes a new approach using a Conditional Random Fields (CRFs) to extract physical and logical layouts in unconstrained handwritten letters such as those sent by indi...
ATAL
2003
Springer
15 years 2 months ago
2003
Springer
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...