ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

3,387 results

Deep Learning with Yacine
How to Serve Big LLM over Decentralized GPUs? | Parallax + Dynamic Programming

deploying a big LLM inference service is complicated and very costly. It's usually reserved for companies that have access to ...

37:07
How to Serve Big LLM over Decentralized GPUs? | Parallax + Dynamic Programming

970 views

1 day ago

AlgOptimize
Dynamic Programming

This will be helpful to anyone who wants to understand the core concepts of Dynamic Programming. This contains how we can ...

9:46
Dynamic Programming

0 views

3 days ago

Games to grow
Dynamic Programming & Backtracking Made

Take your coding skills to the next level by mastering the two essential "mindsets" of advanced problem solving: Dynamic ...

6:04
Dynamic Programming & Backtracking Made

57 views

7 days ago

Code Crunchers
CSE 246 Algorithm | Dynamic Programming (LIS) Explained | Class 09 | Code Crunchers

In this class, we cover CSE 246 – Algorithm, focusing on one of the most important topics in Dynamic Programming: Longest ...

17:32
CSE 246 Algorithm | Dynamic Programming (LIS) Explained | Class 09 | Code Crunchers

5 views

7 days ago

The Structural Econ Guy
Why Choices Today Affect Tomorrow: Intro to the Bellman Equation

This video introduces the Bellman equation through a simple two-period dynamic discrete choice model. We build intuition for ...

8:40
Why Choices Today Affect Tomorrow: Intro to the Bellman Equation

60 views

6 days ago

Lattice
Don't write code like this

Learn for free on Brilliant for a full 30 days: https://brilliant.org/Lattice/. You'll also get 20% off an annual Premium subscription.

8:21
Don't write code like this

54,092 views

5 days ago

AlgoCamp
Shortest Common Subsequence | DP Series Part 32

Starting a brand new Dynamic Programming Series as part of our Free DSA Playlist! In this series, we'll break down the core ...

45:36
Shortest Common Subsequence | DP Series Part 32

78 views

6 days ago

JeyScript
Why Dynamic Programming is so hard | How to solve it in easy way.

Does "Time Limit Exceeded" haunt your dreams? You are not alone. Dynamic Programming (DP) is easily the most intimidating ...

1:43
Why Dynamic Programming is so hard | How to solve it in easy way.

156 views

4 days ago

Institute of Aeronautical Engineering
0 1 Knapsack Problem using Dynamic Programming by Dr. K Suvarchala

0 1 Knapsack Problem using Dynamic Programming by Dr. K Suvarchala | IARE | #01Knapsack #KnapsackProblem ...

1:02:20
0 1 Knapsack Problem using Dynamic Programming by Dr. K Suvarchala

4 views

11 hours ago

Computer Science & IT Conference Proceedings
Performance Impact Factors for the Knapsack Algorithm Based on Dynamic Programming

KnapsackProblem#DynamicProgramming#AlgorithmAnalysis#ComputationalComplexity#PseudoPolynomialTime# ...

27:01
Performance Impact Factors for the Knapsack Algorithm Based on Dynamic Programming

3 views

6 days ago

Aden Jessee
The Dark Side of Design Patterns

... and Peter Norvig's “Design Patterns in Dynamic Programming”. Understand patterns as solutions to recurring design forces and ...

10:08
The Dark Side of Design Patterns

36 views

6 days ago

AlgoCamp
Slimes | DP Series Part 33

Starting a brand new Dynamic Programming Series as part of our Free DSA Playlist! In this series, we'll break down the core ...

51:05
Slimes | DP Series Part 33

46 views

5 days ago

SERA TECH
dynamic programming Fibonacci sequence

how to trace Fibonacci without VS with using dynamic programming.

14:47
dynamic programming Fibonacci sequence

0 views

4 days ago

ICPC Benha Community
Dynamic Programming (Recursive) | Level 3

DP #recursive #dynamicprogramming #array صفحات ICPC Benha Community فيسبوك: / bfcai.acpc لينكد إن: / icpc-benha ...

3:10:58
Dynamic Programming (Recursive) | Level 3

44 views

19 hours ago

Wookash Podcast
Avoiding Modern C++ | Anton Mikhailov

Anton Mikhailov X: https://x.com/antovsky Anton's Calculator - Naut: https://antovsky.itch.io/naut Wookash Podcast Show links: ...

2:21:42
Avoiding Modern C++ | Anton Mikhailov

15,651 views

3 days ago

WYCode
LC3797 Count Routes to Climb a Rectangular Grid (Hard)

Reasoning: https://cojudge.cloud/p/vbrs Solution: https://cojudge.cloud/p/idtq Timecodes: 0:00 Problem 3:18 Intuition 16:59 ...

39:41
LC3797 Count Routes to Climb a Rectangular Grid (Hard)

7 views

6 days ago

codeWithKhan
Leetcode 3640 | Maximum Sum of Trionic Subarray | Dynamic Programming Explained

In this video, we solve LeetCode – Maximum Sum of Trionic Subarray step by step A trionic subarray follows this exact pattern: ...

28:24
Leetcode 3640 | Maximum Sum of Trionic Subarray | Dynamic Programming Explained

15 views

6 days ago

Penrose Learning
How to Solve Algorithm Problems (easy Method)

How to Solve Algorithm Problems (easy Method) | Thanks for watching! Consider subscribing if we helped you! Dive into the world ...

1:35
How to Solve Algorithm Problems (easy Method)

0 views

4 days ago

James Peralta
@pkodes1 Takes On One of My Coding Interviews!!

... feedback 1:11:00-DP discussion 1:13:17-Alt modeling + wrap #CodingInterview #DynamicProgramming #PythonInterview.

1:13:54
@pkodes1 Takes On One of My Coding Interviews!!

641 views

6 days ago

Better Stack
Vite, Rust & The Future of JavaScript Tooling | Better Stack Podcast Ep. 11

In this episode, Evan You, creator of Vue.js and Vite, shares his journey from building Vite to founding VoidZero and developing a ...

55:25
Vite, Rust & The Future of JavaScript Tooling | Better Stack Podcast Ep. 11

4,302 views

1 day ago