{"id":774,"date":"2021-05-12T14:30:00","date_gmt":"2021-05-12T12:30:00","guid":{"rendered":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2021\/05\/05\/uebung-1\/"},"modified":"2021-05-12T17:55:34","modified_gmt":"2021-05-12T15:55:34","slug":"uebung-1","status":"publish","type":"post","link":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2021\/05\/12\/uebung-1\/","title":{"rendered":"\u00dcbung 2"},"content":{"rendered":"\n

In dieser \u00dcbung besch\u00e4ftigen wir uns intensiver mit Dynamic Programming. Daf\u00fcr schauen wir uns mit Longest Common Subsequence<\/em> und Matrix Chain Multiplication<\/em> zwei neue Probleme an und konstruieren schrittweise Dynamic Programming Ans\u00e4tze, um sie zu l\u00f6sen.<\/p>\n\n\n\n

Folien<\/strong>: U2.pdf<\/a>
Video:<\/strong>
[YouTube]<\/a>, [IBR]<\/a><\/p>\n\n\n\n

<\/p>\n\n\n\n

Weitere Links<\/h3>\n\n\n\n

Live-Demo<\/a> f\u00fcr Matrix-Chain-Multiplication<\/p>\n","protected":false},"excerpt":{"rendered":"

In dieser \u00dcbung besch\u00e4ftigen wir uns intensiver mit Dynamic Programming. Daf\u00fcr schauen wir uns mit Longest Common Subsequence und Matrix Chain Multiplication zwei neue Probleme an und konstruieren schrittweise Dynamic Programming Ans\u00e4tze, um sie zu l\u00f6sen.<\/p>\n","protected":false},"author":1,"featured_media":780,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"default","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","_expiration-date-status":"saved","_expiration-date":0,"_expiration-date-type":"","_expiration-date-categories":[],"_expiration-date-options":[]},"categories":[13],"tags":[],"_links":{"self":[{"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/posts\/774"}],"collection":[{"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/comments?post=774"}],"version-history":[{"count":5,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/posts\/774\/revisions"}],"predecessor-version":[{"id":797,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/posts\/774\/revisions\/797"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/media\/780"}],"wp:attachment":[{"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/media?parent=774"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/categories?post=774"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/tags?post=774"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}