• 沒有找到結果。

np EX DX

N/A
N/A
Protected

Academic year: 2022

Share "np EX DX"

Copied!
5
0
0

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

全文

(1)

1

(2)

正态分布 指数分布 均匀分布 几何分布 泊松分布 二项分布

0-1

分布

分布律或概率密度 分 布

{ } k(1 )1 k

P Xkpp

{ } nk k(1 )n k P X k C p p

{ }

!

k

P X k e

k

 

{ } (1 )k 1

P Xk   p p

1 ,

( )

0

a x b f x b a

 

 其它

,.

, 0,

( ) 0, 0.

e x x

f x x

 

  

2

2 2

( ) 1

2

x

f x e



EX

p np

1 p 2 a b

1

DX

(1 ) pp

(1 ) npp

2

1 p p

( )2

12 b a

2

1

2

~ (1, ) X B p

~ ( , ) X B n p

~ ( ) X P

~ [ , ] X U a b

~ ( ) X E

~ ( , 2)

X N   2

0,1 k

0,1, , k n

0,1, 2,

k  

1, 2,

k  

~ ( ) X G p

(3)

3

(4)

4

(5)

5

參考文獻

相關文件

The Seed project, REEL to REAL (R2R): Learning English and Developing 21st Century Skills through Film-making in Key Stage 2, aims to explore ways to use film-making as a means

We point out that extending the concepts of r-convex and quasi-convex functions to the setting associated with second-order cone, which be- longs to symmetric cones, is not easy

這些問題目前尚未找到可以在 polynomial time 內解決的 algorithm.. 這些問題目前尚未被證明無法在 polynomial time

The set of concrete decision problems that are polynomial-

 The class of languages decided by polynomi al-time algorithms 是 the class of languages accepted by polynomial-time algorithms 的 su bset.. G=(V,E) is a simple cycle that contains

Reclamation Rock Cavern Development Reuse of Ex-quarry Sites Redevelopment.. Rezoning Land

 If SAT can be solved in deterministic polynomial time, then so can any NP problems  SAT ∈ NP-hard..  If A is an NP-hard problem and B can be reduced from A, then B is an

The well-known halting problem (a decision problem), which is to determine whether or not an algorithm will terminate with a given input, is NP-hard, but