• 沒有找到結果。

SEQUENTIAL ANALYSIS DESIGN METHODS & APPLICATIONS Volume 27, No. 2, 2008

N/A
N/A
Protected

Academic year: 2022

Share "SEQUENTIAL ANALYSIS DESIGN METHODS & APPLICATIONS Volume 27, No. 2, 2008"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

SEQUENTIAL ANALYSIS DESIGN METHODS & APPLICATIONS

Volume 27, No. 2, 2008

CONTENTS

Editor's Note 105 On a Conjecture of Bechhofer, Kiefer, and Sobel for the

Levin-Robbins-Leu Binomial Subset Selection Procedures 106 C. -S. Leu and B. Levin

On the Performance of the Fluctuation Test for Structural Change 126 L. Horvath, M. Kiihn, and J. Steinebach

Minimax Methods for Multihypothesis Sequential Testing

and Change-Point Detection Problems 141 B. Brodsky and B. Darkhovsky

Estimation of Survival Distributions Under Right-Censoring

When Sample Size is Random 174 A. Rossa

Two-Stage Equivalence Tests That Control Both Size and Power 185 K. Yata

Multidecision Quickest Change-Point Detection:

Previous Achievements and Open Problems 201 A. G. Tartakovsky

參考文獻

相關文件

Calculate the amortized cost of each operation based on the potential function 4. Calculate total amortized cost based on

jobs

minimum number of steps.. A while later, a policeman discovers the car is missing and starts to pursue the thief on foot. His maximum running speed equals to two times the

You are asked to derive a dynamic programming algorithm to derive the minimum total distance.. (10%) Prove that this problem exhibits

In low bit-rate communications strongly affected by Doppler effect, like those making use of non-geostationary satellites, significant carrier phase drifts may occur within

"Analysis and Design of a Multiple Feedback Loop Control Strategy for Single- phase Voltage-source UPS Inverters,"IEEE Transactions on Power Electronics, Vol..

The combined weight of the man and the paint is 185 lb, so the force exerted (equal and opposite to that exerted by gravity) is F = 185 k.. All

Con- cerning the complexity of the k-power domination problem, we first show that deciding whether a graph admits a k-power dominating set of size at most t is NP-complete for