269 search results - page 15 / 54 » A branch and bound method for stochastic global optimization |
108
click to vote
JMLR
2010
14 years 4 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
IOR
2007
14 years 9 months ago
2007
This paper develops simple approximate methods to analyze a two-stage stochastic distribution system consisting of one warehouse and multiple retailers. We consider local and cent...
DAGM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We consider the problem of simultaneously registering several images to a 3D model. We propose a global approach based on mutual information that extends previous methods...
AAAI
2010
14 years 11 months ago
2010
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
112
click to vote
MOR
2007
14 years 9 months ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...