Tag

algorithms

The Random Cut Forest Algorithm

From Machine Learning for Business by Doug Hudgeon and Richard Nichol

In this article, you’ll see how SageMaker and the Random Cut Forest algorithm can be used to create a model that will highlight the invoice lines that Brett should query with the law firm. The result will be a repeatable process that Brett can apply to every invoice that will keep the lawyers working for his bank on their toes and will save the bank hundreds of thousands of dollars per year. Off we go!

The Towers of Hanoi: six questions with David Kopec

Six Questions for David Kopec, author of Classic Computer Science Problems in Python

David Kopec is Assistant Professor in computer science at Vermont’s Champlain College and author of two books in the Classic Problems series. If you want more, find @davekopec on Twitter.

Anticipating your Opponent with Minimax Search

From Deep Learning and the Game of Go by Max Pumperla and Kevin Ferguson

This article shows you how to use the minimax algorithm to help your game bot decide its next move.

Constraint-Satisfaction Problems in Python

From Classic Computer Science Problems in Python by David Kopec

A large number of problems which computational tools solve can be broadly categorized as constraint-satisfaction problems (CSPs). CSPs are composed of variables with possible values which fall into ranges known as domains. Constraints between the variables must be satisfied in order for constraint-satisfaction problems to be solved. Those three core concepts—variables, domains, and constraints—are simple to understand, and their generality underlies the wide applicabilit

Learn the Math You Need for Today’s Hottest Careers!

From Math for Programmers by Paul Orland

slideshare-learn-the-math-you-need-for-todays-hottest-careers 

Learning Computer Science with Python

From Classic Computer Science Problems in Python by David Kopec


slideshare-learning-computer-science-with-python

Creating a Tic-Tac-Toe AI with Swift and the minimax Algorithm

From Classic Computer Science Problems in Swift by David Kopec

This article will teach you how to use the minimax algorithm to create a Tic-Tac-Toe AI that plays the game flawlessly.

Delve into Algorithms


slideshare-delve-into-algorithms
From Algorithms in Motion
By Beau Carnes

Solving Mazes with Swift

From Classic Computer Science Problems in Swift by David Kopec

This article is all about finding a path through mazes, which is an analogous to many common search problems in computer science. Examples are in Swift.

A* Search in Swift: navigating a maze


slideshare-a-asterisk-search-in-swift-navigating-a-maze
From Classic Computer Science Problems in Swift
By David Kopec

© 2019 Manning — Design Credits