排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
Efficient algorithms are described for computing the probability of detection for a binary integration when the probability of a threshold crossing changes from sample to sample. A binary integrator is exceeded (a hit occurs) in a sequence of N trials and declares a detection if the number of hits is at least as large as some number M, where O> 相似文献
1