Главная
Study mode:
on
1
Intro
2
What do I mean by "Artificial Intelligence"?
3
Types of Al Models
4
Constraint-Based Optimization
5
Classes of Problems
6
Feasibility vs. Optimization
7
Constraint: A Required Condition
8
Types of constraints
9
Objective: A Goal for the Solution
10
Constraint Programming: Sudoku
11
Linear Example: Pete's Pottery Paradise
12
Pottery Production - Solution Space
13
Pottery Production - The Polytope
14
Defining an Optimization Model
15
Decision Variables
16
Execute the Model
17
Mixed-Integer Example: Scheduling
18
LP Model - Variables
19
LP Model - Constraints
20
MIP Model - Variables
21
MIP Model - Constraints
22
MIP Model - Objective Example
23
Summary
24
Resources
Description:
Explore mathematical optimization techniques for AI problem-solving in this comprehensive conference talk. Dive into constraint-based optimization, feasibility vs. optimization, and various problem classes. Learn to define optimization models using decision variables, constraints, and objectives. Examine real-world examples like Sudoku and scheduling problems. Gain practical insights into implementing these concepts using Google OR-Tools, with a focus on code implementation rather than complex mathematics. Discover how to efficiently solve problems with multiple solutions in AI systems, including capacity utilization, shortest path finding, and optimal scheduling. Perfect for software developers looking to enhance their AI development skills with optimization techniques.

Building AI Solutions with Google OR-Tools

NDC Conferences
Add to list