Information Technology Reference
In-Depth Information
Table 1.
Result of an initial search
m
Description
n
max
n
e
m − n
e
Answer to
Q.2
5
Q,EEW
6
0
5
0
6
SS
7
7
Q,EEW
8
8
-1
1
8
SS
9
9
U
10
10
-1
3
10
SS
11
11
Q,EEW
12
11
0
30
12
SS
13
13
Q,EEW
14
13
0
17
14
U
14
14
0
2
15
SS
16
15
0
1
16
SS
17
16
0
1
17
Q,EEW
18
16
1
33
18
SS
19
19
Q,EEW
20
17
2
321
20
U
18
18
2
136
21
U
19
19
2
17
22
SS
23
23
Q,EEW
24
24
SS
25
25
U
22
22
3
4
26
SS
27
27
U
?
28
SS
29
29
Q,EEW
30
30
SS
31
31 Q,EEW,SS
32
32
U
?
33
U
?
34
U
?
35
U
?
SS
:Shift Sequence
Q
:Quadratic
EEW
:Extended Exponential Welch
U
:Unidentified
3 Probabilistic Approach
The idea is in the back-tracking algorithm. The algorithm must check each dif-
ferential value whether it (potentially) violates DMDP or not. Checking can be
