magistraleinformatica:ad:ad_19:start
Differenze
Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.
Entrambe le parti precedenti la revisioneRevisione precedente | |||
magistraleinformatica:ad:ad_19:start [05/06/2020 alle 14:49 (5 anni fa)] – [Announcements] Roberto Grossi | magistraleinformatica:ad:ad_19:start [07/07/2020 alle 07:59 (5 anni fa)] (versione attuale) – Roberto Grossi | ||
---|---|---|---|
Linea 83: | Linea 83: | ||
|24.04.2020| NP-hard problems: download file manager and the knapsack problem. Reduction from Partition to Knapsack (restriction). Dynamic programming algorithms for Knapsack: Case 1: integer weights, complexity O(nW). Case 2: integer values, complexity O(n< | |24.04.2020| NP-hard problems: download file manager and the knapsack problem. Reduction from Partition to Knapsack (restriction). Dynamic programming algorithms for Knapsack: Case 1: integer weights, complexity O(nW). Case 2: integer values, complexity O(n< | ||
|28.04.2019| NP-hard problems: heuristics based on dynamic programming; | |28.04.2019| NP-hard problems: heuristics based on dynamic programming; | ||
- | + | |30.04.2019| Clique-based social network analysis (seminar by F.Geraci) | classroom drive | | |
- | 30 | + | |
|05.05.2020| NP-hard problems: counting version (#P) based on dynamic programming, | |05.05.2020| NP-hard problems: counting version (#P) based on dynamic programming, | ||
|07.05.2020| NP-hard problems: fully polynomial-time randomized approximation schemes (FPRASs). Case study: #knapsack problem. | {{ : | |07.05.2020| NP-hard problems: fully polynomial-time randomized approximation schemes (FPRASs). Case study: #knapsack problem. | {{ : |
magistraleinformatica/ad/ad_19/start.1591368548.txt.gz · Ultima modifica: 05/06/2020 alle 14:49 (5 anni fa) da Roberto Grossi