Optimization algorithms and methods
A constructive heuristic is a type of heuristic method which starts with an empty solution and repeatedly extends the current solution until a complete solution is obtained. It differs from local search heuristics which start with a complete solution and then try to improve the current solution further via local moves. Examples of some famous problems that are solved using constructive heuristics are the flow shop scheduling, the vehicle routing problem and the open shop problem. (Wikipedia).
Show Me Some Science! Constructive and Destructive Interference
Waves are one way in which energy can be send down a string. When two waves meet, they interact. This interaction is called interference. If two waves add up this is known as "constructive interference" and if they cancel out it's "destructive interference". After the waves interact, they
From playlist Show Me Some Science!
Klaus Mainzer: Constructivity and Computability. Perspectives for Mathematics [...]
Title: Klaus Mainzer: Constructivity and Computability. Perspectives for Mathematics, Computer Science, and Philosophy The lecture was held within the framework of the Hausdorff Trimester Program: Constructive Mathematics. Abstract: Since antiquity, mathematical proofs were realized by
From playlist Workshop: "Constructive Mathematics"
Bishop's Constructive Analysis
In this video I speak about the Constructive Analysis approach spearheaded by Bishop. I start a review of Techniques of Constructive analysis, discuss the Axiom of Dependent Choice, and so on. Text used in this video: https://gist.github.com/Nikolaj-K/2207cacbd7cc15f20a9b81bb2be04285 See a
From playlist Logic
Giuseppe Rosolini: Categorical completions in constructive mathematics
The lecture was held within the framework of the Hausdorff Trimester Program: Constructive Mathematics. Abstract: There seems to be a very close connection between category theory and constructive mathematics which still is hard to make manifest, but which may be extremely useful to impr
From playlist Workshop: "Constructive Mathematics"
Five Stages of Accepting Constructive Mathematics - Andrej Bauer
Andrej Bauer University of Ljubljana, Slovenia; Member, School of Mathematics March 18, 2013 Discussions about constructive mathematics are usually derailed by philosophical opinions and meta-mathematics. But how does it actually feel to do constructive mathematics? A famous mathematician
From playlist Mathematics
Henri Lombardi: A geometric theory for the constructive real number system and for o-minimal struct
Title: Henri Lombardi: A geometric theory for the constructive real number system and for o-minimal structures The lecture was held within the framework of the Hausdorff Trimester Program: Constructive Mathematics. Abstract: We work in a pure constructive context, minimalist, à la Bish
From playlist Workshop: "Constructive Mathematics"
Hugo Herbelin: A constructive proof of dependent choice, compatible with classical logic
The lecture was held within the framework of the Hausdorff Trimester Program: Constructive Mathematics. Abstract: Martin-Löf's type theory has strong existential elimination (dependent sum type) what allows to prove the full axiom of choice. However the theory is intuitionistic. We give
From playlist Workshop: "Constructive Mathematics"
17.2 Constructive and Destructive Interference of Sound Waves
This video covers Section 17.2 of Cutnell & Johnson Physics 10e, by David Young and Shane Stadler, published by John Wiley and Sons. The lecture is part of the course General Physics - Life Sciences I and II, taught by Dr. Boyd F. Edwards at Utah State University. This video was produced
From playlist Lecture 17A. Linear Superposition and Interference Phenomena
Ulrich Berger: On the Computational content of Brouwer's Theorem
The lecture was held within the framework of the Hausdorff Trimester Program: Constructive Mathematics. Abstract: The usual formulation of Brouwer's Theorem ('every bar is inductive')involves quantification over infinite sequences of natural numbers. We propose an alternative formulation
From playlist Workshop: "Constructive Mathematics"
Vinod Nair - Restricted Boltzmann Machines for Maximum Satisfiability - IPAM at UCLA
Recorded 27 February 2023. Vinod Nair of Google Brain presents "Restricted Boltzmann Machines for Maximum Satisfiability" at IPAM's Artificial Intelligence and Discrete Optimization Workshop. Abstract: In the past two decades, machine learning workloads have been transformed by the availab
From playlist 2023 Artificial Intelligence and Discrete Optimization
Bjorn Poonen, Heuristics for the arithmetic of elliptic curves
VaNTAGe seminar on Sep 1, 2020. License: CC-BY-NC-SA. Closed captions provided by Brian Reinhart.
From playlist Rational points on elliptic curves
Efficient Verification of Computation on Untrusted Platforms - Yael Kalai
Computer Science/Discrete Mathematics Seminar I Topic: Efficient Verification of Computation on Untrusted Platforms Speaker: Yael Kalai Affiliation: Massachusetts Institute of Technology/Microsoft Date: February 13, 2023 Efficient verification of computation is fundamental to computer sc
From playlist Mathematics
PCP and Delegating Computation: A Love Story - Yael Tauman Kalai
Computer Science/Discrete Mathematics Seminar I Topic: PCP and Delegating Computation: A Love Story Speaker: Yael Tauman Kalai Affiliation: Microsoft Research Date: January 28, 2019 For more video please visit http://video.ias.edu
From playlist Mathematics
LambdaConf 2015 - Introduction to Constraint Logic Programming Sergii Dymchenko
Constraint logic programming is a paradigm that allows solving hard combinatorial problems with minimal programming effort. In this workshop you will learn the basics of the Prolog-based constraint logic programming system ECLiPSe, solve several puzzles, and get hints how constraint logic
From playlist LambdaConf 2015
Rational curves on elliptic surfaces - Douglas Ulmer
A Joint IAS/Princeton University Number Theory Seminar Topic: Rational curves on elliptic surfaces Speaker: Douglas Ulmer Affiliation: Georgia Institute of Technology Date: Thursday, May 5 Given a non-isotrivial elliptic curve EE over K=𝔽qt K=Fqt, there is always a finite extension L
From playlist Mathematics
Tony Yue Yu - 1/4 The Frobenius Structure Conjecture for Log Calabi-Yau Varieties
Notes: https://nextcloud.ihes.fr/index.php/s/GwJbsQ8xMW2ifb8 1/4 - Motivation and ideas from mirror symmetry, main results. --- We show that the naive counts of rational curves in an affine log Calabi-Yau variety U, containing an open algebraic torus, determine in a surprisingly simple wa
From playlist Tony Yue Yu - The Frobenius Structure Conjecture for Log Calabi-Yau Varieties
Heuristics for the arithmetic of elliptic curves – Bjorn Poonen – ICM2018
Number Theory Invited Lecture 3.6 Heuristics for the arithmetic of elliptic curves Bjorn Poonen Abstract: This is an introduction to a probabilistic model for the arithmetic of elliptic curves, a model developed in a series of articles of the author with Bhargava, Kane, Lenstra, Park, Ra
From playlist Number Theory
The Colorful Connected Subgraph Problem - Richard Karp
A Celebration of Mathematics and Computer Science Celebrating Avi Wigderson's 60th Birthday October 5 - 8, 2016 More videos on http://video.ias.edu
From playlist Mathematics
This video explains the distinction between constructive and destructive forms of wave interference and discusses how to use the principle of superposition to determine the shape of the wave resulting from the interference of the two waves. Give Mr. H 10 minutes of time and be a pro on the
From playlist Vibrations and Waves