slides
slides
slides
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
• monotonicity<br />
Monotonicity<br />
Let K =(A, ⊕, ⊗, 0, 1) be a semiring, and ≤ a partial ordering over A.<br />
We say K is monotonic if for all a, b, c ∈ A<br />
(a ≤ b) ⇒ (a ⊗ c ≤ b ⊗ c) (a ≤ b) ⇒ (c ⊗ a ≤ c ⊗ b)<br />
• optimal substructure in dynamic programming<br />
A: b ⊗ c<br />
• [lemma] idempotent => monotone<br />
A: b’ ⊗ c<br />
b ⊗ c<br />
<br />
Liang Huang<br />
10<br />
Dynamic Programming