269 search results - page 13 / 54 » A branch and bound method for stochastic global optimization |
119
click to vote
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
We present a new algorithm to jointly track multiple objects in multi-view images. While this has been typically addressed separately in the past, we tackle the problem as a single...
68
Voted
EOR
2008
14 years 9 months ago
2008
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
ANOR
2005
14 years 9 months ago
2005
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
ECML
1998
Springer
15 years 1 months ago
1998
Springer
Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus a...
ASC
2004
14 years 9 months ago
2004
Global optimization can be used as the main component for reliable decision support systems. In this contribution, we explore numerical solution techniques for nonconvex and nondi...