Upload date
All time
Last hour
Today
This week
This month
This year
Type
All
Video
Channel
Playlist
Movie
Duration
Short (< 4 minutes)
Medium (4-20 minutes)
Long (> 20 minutes)
Sort by
Relevance
Rating
View count
Features
HD
Subtitles/CC
Creative Commons
3D
Live
4K
360°
VR180
HDR
19 results
Let us introduce a new interesting problem that requires a generalization of the 1D element constraint: The array that is indexed is ...
14 views
5 days ago
We now have a domain but not the variables yet. As you will probably imagine we will use our sparset-set domain but a variable ...
33 views
Of course the whole goal of a scheduling problem is to decide the start time for each activity, but is this always the most efficient ...
8 views
Finn Bálor goes old school as he enters to challenge World Heavyweight Champion CM Punk. Catch WWE action on the ESPN ...
768,924 views
We implement TinyCSP so that our N-Queens model works as expected. All the ingredients and concepts of a true CP solver are ...
141 views
Can you think about how to use the earliest completion time and the beautiful theta trees to detect inconsistencies efficiently for a ...
7 views
We have seen the constraint-store and the fix-point theoretical idea. Now comes the time to translate it into a concrete ...
27 views
Introduction to Mini-CP. In this video, we introduce the N-Queens problem. We argue about the possible modeling alternatives, ...
303 views
Want to learn deeper? Check out my upcoming live online self makeup sessions - https://wa.link/l76n20 Struggling with deep, ...
5,793 views
1 day ago
OK, now you get the general idea of a sparse-set but as always, we want to show you the implementation to make sure you ...
40 views
Depth-First-Search (DFS) is the favorite search of CP solvers. We are going to see the code of DFS for MiniCP. Of course we need ...
26 views
CHCH is proud to be the news leader for the Hamilton, Halton and Niagara regions. We are committed to sharing your stories and ...
8,101 views
Streamed 11 hours ago
The previous filtering based on nodes' degrees is not sufficient to prevent the formation of subtours. We need something more.
10 views
We have seen that large neighborhood search can greatly help to discover good solutions quickly but for makespan minimization, ...
We explain the graph-coloring problem, the problem that you will solve in the first programming assignment.
81 views
Great, we have now reduced the left part of the time windows. Do we need to do the same to reduce the right part or can we avoid ...
5 views
This video explains the difference between CBTS & CBTS 2.0 on SELEXN app and website. You will also get to know about the ...
4,353 views
20 hours ago
You will get this pdf on my telegram channel. Its link is give in the description below. In the pdf you get to know about the ...
15,572 views
3 days ago
🌺 TS District Court Junior Assistant Notification 2026 is officially released! In this video, we explain complete details ...
15,553 views