Главная
Study mode:
on
You
History
Saved
In progress 0 courses
compleat 0 courses
#Art & Design #Adobe #ChatGPT #GitHub

#Constraint Satisfaction Problems

Showing: 26 courses
NPTEL

Artificial Intelligence

1 rewiews
Explore artificial intelligence fundamentals, algorithms, and applications. Learn about search techniques, game theory, planning, expert systems, logic, and constraint satisfaction problems.
Add to list
95 Lesons
1 day 16 hours
On-Demand
Free-Video
NPTEL

Artificial Intelligence

0 rewiews
Comprehensive exploration of AI concepts, from search algorithms and logic to planning, expert systems, uncertainty reasoning, fuzzy logic, machine learning, and natural language processing.
Add to list
40 Lesons
1 day 14 hours
On-Demand
Free-Video
NPTEL

Artificial Intelligence

0 rewiews
Comprehensive exploration of AI concepts, algorithms, and techniques, covering search strategies, optimization methods, game playing, planning, constraint satisfaction, and knowledge-based systems.
Add to list
48 Lesons
1 day 15 hours
On-Demand
Free-Video
NPTEL

An Introduction to Artificial Intelligence

0 rewiews
Comprehensive exploration of AI fundamentals, covering search algorithms, game theory, logic, uncertainty, Bayesian networks, and reinforcement learning, with historical context and practical applications.
Add to list
98 Lesons
1 day 8 hours
On-Demand
Free-Video
Galileo Galilei Institute

Introduction to the Dynamics of Disordered Systems: Equilibrium and Gradient Descent - Lecture 1

0 rewiews
Explore disordered systems dynamics, covering glasses, jamming transitions, and optimization problems. Gain insights into metastable states and algorithmic applications in various fields.
Add to list
14 Lesons
1 hour 45 minutes
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

A Quick and Partial Survey on the Complexity of Query Answering

0 rewiews
Explore the complexity of query answering in this survey, covering key concepts and recent developments in discrete mathematics and logic.
Add to list
1 Lesons
1 hour 1 minute
On-Demand
Free-Video
Ryan O'Donnell

Goemans-Williamson: Rounding the Max-Cut SDP - Lecture 20a of CS Theory Toolkit

0 rewiews
Efficient algorithm for approximating maximum graph cuts using semidefinite programming and randomized rounding, with guaranteed performance ratio of 0.878.
Add to list
7 Lesons
32 minutes
On-Demand
Free-Video
Simons Institute

Improved Streaming Algorithms for Max-DICUT via Local Snapshots

0 rewiews
Explore advanced streaming algorithms for Max-DICUT problem, focusing on local graph snapshots to surpass the 4/9 approximation in sublinear space.
Add to list
1 Lesons
45 minutes
On-Demand
Free-Video
Simons Institute

Sparsification: Graphs, CSPs and Codes - Sublinear Graph Simplification

0 rewiews
Explore graph sparsification, CSP compression, and code sparsification techniques. Learn about cutting-edge research in sublinear graph simplification and its applications to various domains.
Add to list
1 Lesons
49 minutes
On-Demand
Free-Video
International Centre for Theoretical Sciences

Why Do Simple Models Work? Partial Answers from Information Geometry - Lecture 1

0 rewiews
Explores information geometry to understand why simple models effectively describe complex systems, focusing on statistical mechanics, renormalization, and model reduction in physics and biology.
Add to list
20 Lesons
1 hour 33 minutes
On-Demand
Free-Video
Institute for Advanced Study

When and How are Promise Constraint Satisfaction Problems Efficiently Solvable

0 rewiews
Delve into the mathematical foundations of Constraint Satisfaction Problems (CSP), exploring algorithmic efficiency, polymorphisms, and promise CSP applications in graph coloring and discrepancy minimization.
Add to list
1 Lesons
1 hour 5 minutes
On-Demand
Free-Video
Neuro Symbolic

Constraint Satisfaction Problems: Consistency Algorithms - Part 6

0 rewiews
Explore consistency algorithms for constraint satisfaction problems in AI, covering formulation, solving methods, and domain splitting.
Add to list
1 Lesons
12 minutes
On-Demand
Free-Video
International Mathematical Union

Constraint Satisfaction Problem - What Makes the Problem Easy

0 rewiews
Explore constraint satisfaction problems, their complexity, and variants. Learn about polynomial-time solvable cases and NP-complete instances in this mathematical deep dive.
Add to list
1 Lesons
43 minutes
On-Demand
Free-Video
Ryan O'Donnell

Trees and Series-Parallel Graphs - Lecture 22a of CS Theory Toolkit

0 rewiews
Explore treewidth, CSPs, and graph theory fundamentals for theoretical computer science research, focusing on trees and series-parallel graphs.
Add to list
6 Lesons
21 minutes
On-Demand
Free-Video
Ryan O'Donnell

Constraint Satisfaction Problems - Lecture 20b of CS Theory Toolkit

0 rewiews
Explore Constraint Satisfaction Problems, their formal definition, examples, and algorithms. Learn about the Dichotomy Theorem and its implications for theoretical computer science research.
Add to list
7 Lesons
32 minutes
On-Demand
Free-Video
Ryan O'Donnell

Analysis of Boolean Functions at CMU - Constraint Satisfaction Problems

0 rewiews
Explore constraint satisfaction problems in boolean functions, covering topics like Max3SAT, Max3Coloring, and approximation algorithms for complex computational challenges.
Add to list
13 Lesons
1 hour 15 minutes
On-Demand
Free-Video
Simons Institute

Sketching Algorithms for Max-DICUT and Other CSPs

0 rewiews
Explore algorithms for Maximum Directed Cut problem in graph theory, focusing on sketching techniques, space complexity, and applications to Constraint Satisfaction Problems.
Add to list
1 Lesons
1 hour
On-Demand
Free-Video
Association for Computing Machinery (ACM)

Tea - A High-level Language and Runtime System for Automating Statistical Analysis

0 rewiews
Introduces Tea, a declarative language for automating statistical analysis. Simplifies hypothesis testing by determining valid tests based on study design and assumptions, lowering barriers to accurate statistical research.
Add to list
1 Lesons
20 minutes
On-Demand
Free-Video
IEEE

Approximating Constraint Satisfaction Problems on High Dimensional Expanders

0 rewiews
Explore high-dimensional expanders and their role in approximating constraint satisfaction problems, with insights on natural collections and general expanders.
Add to list
12 Lesons
18 minutes
On-Demand
Free-Video
IEEE

Optimal Streaming Approximations for All Boolean Max 2-CSPs and Max k-SAT

0 rewiews
Explore streaming approximations for Boolean Max 2-CSPs and Max k-SAT, covering algorithms, lower bounds, and communication complexity in constraint satisfaction problems.
Add to list
15 Lesons
25 minutes
On-Demand
Free-Video
Institute for Advanced Study

How Efficiently Can We Solve Unique Games? - Lecture

0 rewiews
Explore the computational complexity of Unique Games and their efficient solutions in this insightful talk by Yotam Dikstein.
Add to list
1 Lesons
16 minutes
On-Demand
Free-Video
Neuro Symbolic

Constraint Satisfaction Problem Variants in AI - Part 2

0 rewiews
Explore constraint satisfaction problem variants, formulation techniques, solving methods, consistency algorithms, and domain splitting in AI.
Add to list
1 Lesons
11 minutes
On-Demand
Free-Video
Centre de recherches mathématiques - CRM

The Complexity of Satisfiable CSPs

0 rewiews
Explore the complexity of satisfiable CSPs, examining dichotomy theorems and their connections to Fourier analysis, product testing, and linearity testing in this mathematical lecture.
Add to list
12 Lesons
44 minutes
On-Demand
Free-Video
BIMSA

Hard and Easy Constraint Problems - ICBS 2024

0 rewiews
Explore the Constraint Satisfaction Problem framework, its connections to various fields, and the resolution of the Feder-Vardi conjecture on efficiently solvable CSPs.
Add to list
1 Lesons
46 minutes
On-Demand
Free-Video
USC Probability and Statistics Seminar

Are Neural Networks Optimal Approximation Algorithms for Constraint Satisfaction Problems?

0 rewiews
Explore neural networks' capability to solve NP-hard optimization problems, focusing on constraint satisfaction and their potential as optimal approximation algorithms.
Add to list
1 Lesons
40 minutes
On-Demand
Free-Video
BIMSA

When and Why Do Efficient Algorithms Exist for Constraint Satisfaction and Beyond

0 rewiews
Explore the mathematical structures behind efficient algorithms for constraint satisfaction problems and beyond, focusing on polymorphisms and their role in computational complexity.
Add to list
1 Lesons
1 hour
On-Demand
Free-Video