ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

14 results

Ahmed Salah ELDin
GREEDY2: Activity Selection II Min Resources

... This video describe the ACTIVITY SELECTION problem in which it's required to schedule ALL activities using the min number of ...

24:56
GREEDY2: Activity Selection II Min Resources

44 views

1 year ago

Chao Xu
Greedy Algs. II & Intro to NP Completeness

Algorithms 15. Greedy Algs. II & Intro to NP Completeness aduni.

1:20:44
Greedy Algs. II & Intro to NP Completeness

2,500 views

13 years ago

Ahmed Salah ELDin
L08 - Greedy: Idea & Examples

Set of lecture videos for the "Analysis & Design of Algorithms" course as taught in 2021 CHP - FCIS - Ain Shams Univ. Materials of ...

1:51:26
L08 - Greedy: Idea & Examples

355 views

1 year ago

aleksignjat
27_03_2018

So let us look at a few problems that are solved by greedy the greedy strategy so assume that in a country anyone knows where ...

50:30
27_03_2018

925 views

7 years ago

ExamBytes
0-1 Knapsack Problem: Dynamic Programming Solution (2-Dimensional)

This video deals with finding the solution to 0-1 Knapsack Problem. The video demonstrates the Dynamic Programming Solution ...

24:57
0-1 Knapsack Problem: Dynamic Programming Solution (2-Dimensional)

154 views

5 years ago

Jeremy Clark
Lecture 07

Accumulators.

47:36
Lecture 07

1,871 views

7 years ago

BeeScala
BeeScala 2016: Aleksandar Prokopec - Bridging the gap towards high-level distributed computing

This talk was recorded at BeeScala 2016 in Ljubljana, Slovenia. Follow along on Twitter @BeeScalaConf and on the website for ...

1:08:56
BeeScala 2016: Aleksandar Prokopec - Bridging the gap towards high-level distributed computing

158 views

8 years ago

Bioinformatics DotCa
Mapping and Genome Rearrangement

Instructor: Jared Simpson.

1:11:10
Mapping and Genome Rearrangement

443 views

8 years ago

Studio IIT Bombay
FSTTCS L37 Edge   Disjoint Paths in Networks

So I'm going to talk about a recent exciting result of Judea sugar about a classical problem known as the edge disjoint path ...

51:48
FSTTCS L37 Edge Disjoint Paths in Networks

98 views

9 years ago

WordPress
Lara Schenck: Bridging the Design and Development Gap with CSS Algorithms

Over the past 10 years, CSS has transformed from a descriptive language for presentation into a Turing-complete, domain-specific ...

42:55
Lara Schenck: Bridging the Design and Development Gap with CSS Algorithms

79 views

6 years ago

economification
Lecture 11.2: Matching mechanisms (Mechanism Design)

Lecture 11.2: Matching model(s) & mechanisms Mechanism Design course (Masters in Economics, UCPH, Fall 2020) *** Full ...

51:14
Lecture 11.2: Matching mechanisms (Mechanism Design)

1,943 views

5 years ago

Musformation // Jesse Cannon
How Musicians Build A Fanbase Of Millions In 2026 (FREE COURSE)

A free full course on the step by step way you grow a music fanbase to millions of fans. Want A FREE Roadmap Of How To Go ...

4:08:05
How Musicians Build A Fanbase Of Millions In 2026 (FREE COURSE)

16,097 views

13 days ago

CIMA UAdeC
Un estudio experimental de la dificultad del Bin Packing Problem

Conferencia "¿Por qué son difíciles los problemas de agrupación? Un estudio experimental de la dificultad del Bin Packing ...

1:29:38
Un estudio experimental de la dificultad del Bin Packing Problem

66 views

3 years ago

Radwan Romy
MATRIX CHAIN MULTIPLICATION IN BANGLA | বাংলা | MINIMUM | MAXIMUM | ALGORITHMS |RADWAN ROMY| BENGALI

Here The Code: https://docs.google.com/document/d/1zq2Wh1sMLRwwTmBGg2x_-hunKFt_ra9phS-8Zyl5lMI/edit?usp=drivesdk ...

21:07
MATRIX CHAIN MULTIPLICATION IN BANGLA | বাংলা | MINIMUM | MAXIMUM | ALGORITHMS |RADWAN ROMY| BENGALI

763 views

6 years ago