Sciweavers

269 search results - page 22 / 54
» A branch and bound method for stochastic global optimization
Sort
View
SPAA
1996
ACM
15 years 1 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
AUTOMATICA
2007
145views more  AUTOMATICA 2007»
14 years 9 months ago
Decentralized adaptive output-feedback stabilization for large-scale stochastic nonlinear systems
In this paper, the problem of decentralized adaptive output-feedback stabilization is investigated for large-scale stochastic nonlinear systems with three types of uncertainties, ...
Shu-Jun Liu, Ji-Feng Zhang, Zhong-Ping Jiang
CORR
2011
Springer
145views Education» more  CORR 2011»
14 years 4 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov
AAAI
2012
13 years 1 days ago
Lagrangian Relaxation Techniques for Scalable Spatial Conservation Planning
We address the problem of spatial conservation planning in which the goal is to maximize the expected spread of cascades of an endangered species by strategically purchasing land ...
Akshat Kumar, XiaoJian Wu, Shlomo Zilberstein
MP
2006
105views more  MP 2006»
14 years 9 months ago
Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach
We consider two-stage pure integer programs with discretely distributed stochastic right-hand sides. We present an equivalent superadditive dual formulation that uses the value fun...
Nan Kong, Andrew J. Schaefer, Brady Hunsaker