Sciweavers

9810 search results - page 1799 / 1962
» Problems, Descriptions and Objects
Sort
View
117
Voted
CORR
2008
Springer
64views Education» more  CORR 2008»
15 years 5 months ago
Linearly Parameterized Bandits
We consider bandit problems involving a large (possibly infinite) collection of arms, in which the expected reward of each arm is a linear function of an r-dimensional random vect...
Paat Rusmevichientong, John N. Tsitsiklis
CSDA
2008
102views more  CSDA 2008»
15 years 5 months ago
Confidence intervals for the difference between two means
: Unit nonresponse and item nonresponse in sample surveys are a typical problem of nonresponse which can be handled by weighting adjustment and imputation methods, respectively. Th...
Weiwen Miao, Paul Chiou
CVIU
2008
180views more  CVIU 2008»
15 years 5 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...
EOR
2010
149views more  EOR 2010»
15 years 5 months ago
Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
Outer linearization methods for two-stage stochastic linear programs with recourse, such as the L-shaped algorithm, generally apply a single optimality cut on the nonlinear object...
Svyatoslav Trukhanov, Lewis Ntaimo, Andrew Schaefe...
EOR
2008
87views more  EOR 2008»
15 years 5 months ago
Robust surgery loading
We consider the robust surgery loading problem for a hospital's operating theatre department, which concerns assigning surgeries and sufficient planned slack to operating roo...
Erwin W. Hans, Gerhard Wullink, Mark van Houdenhov...
« Prev « First page 1799 / 1962 Last » Next »