Crash Course
Web Search
Today we’re going to talk about search engines, which are just AI systems that try to help us find what we’re looking for. Search engines can be the sort that serve up a list of results, like during a Google or Bing search, using web...
Curated Video
Introducing Blinks: The Next Generation Search Engine
Blinks is a revolutionary search engine that goes beyond traditional keyword searches. It automatically compiles suggestions based on the documents you read and write, searching not only the Internet but also your own computer files and...
SciShow
How Are Search Engines So Fast?
Google can find something for you on the other side of the world in less than a second. Why does your personal computer take so much longer?
Food Farmer Earth
Navigating Water Scarcity: Sustainable Agriculture and the Ogallala Aquifer on the Texas High Plains
This video discusses the critical challenge of water scarcity for farmers on the Texas High Plains, focusing on the Ogallala Aquifer's depletion and the impact on irrigated agriculture. It highlights innovative research and practices...
Crash Course
The World Wide Web: Crash Course Computer Science
Today we’re going to discuss the World Wide Web - not to be confused with the Internet, which is the underlying plumbing for the web as well as other networks. The World Wide Web is built on the foundation of simply linking pages to...
SciShow
How Are Search Engines So Fast?
Google can find something for you on the other side of the world in less than a second. Why does your personal computer take so much longer? Hosted by: Olivia Gordon SciShow has a spinoff podcast! It's called SciShow Tangents. Check it...
Zach Star
Today In Engineering (Episode 1)
This video covers just a few current events going on in engineering and computer science. The topics here include 1. Origami Algorithm 2. Algorithm to see around corners 3. Laser on Fighter Jet 4. Drones for Warehouse Product Search 5....
Packt
Compare the breadth-first and depth-first search algorithms : What Are We Searching for?
From the section: Searching in Graphs. In this section, we will see what we are searching for. Also, we will look at how to use and implement Breadth-First Search and Depth-First Search along with a simple puzzle game example. What does...
Packt
Compare the breadth-first and depth-first search algorithms : Introduction to File Search Application
From the section: Shortest Time Search (Depth First Search). Understand the application that we will develop in this section by answering the questions. • What is search • What is file search • How does it work Understand the application...
Packt
Compare the breadth-first and depth-first search algorithms : Search Problem Formulation
From the section: Shortest Time Search (Depth First Search). Understand and implement the concept of state and the three main ingredients of search problems by answering the questions. • Initial state: where do we start searching from •...
Packt
Compare the breadth-first and depth-first search algorithms : Implementing DFS
From the section: Searching in Graphs. In this section, we will see what we are searching for. Also, we will look at how to use and implement Breadth-First Search and Depth-First Search along with a simple puzzle game example. Implement...
Packt
Compare the breadth-first and depth-first search algorithms : Using Breadth-First Search (BFS)
From the section: Searching in Graphs. In this section, we will see what we are searching for. Also, we will look at how to use and implement Breadth-First Search and Depth-First Search along with a simple puzzle game example. Learn the...
Packt
Compare the breadth-first and depth-first search algorithms : Using Depth-First Search (DFS)
From the section: Searching in Graphs. In this section, we will see what we are searching for. Also, we will look at how to use and implement Breadth-First Search and Depth-First Search along with a simple puzzle game example. Learn the...
Packt
Compare the breadth-first and depth-first search algorithms : Implementing BFS on Regular Graphs
From the section: Searching in Graphs. In this section, we will see what we are searching for. Also, we will look at how to use and implement Breadth-First Search and Depth-First Search along with a simple puzzle game example. Implement...
Packt
Compare the breadth-first and depth-first search algorithms : Example - A Simple Puzzle Game
From the section: Searching in Graphs. In this section, we will see what we are searching for. Also, we will look at how to use and implement Breadth-First Search and Depth-First Search along with a simple puzzle game example. Solve the...
Packt
Compare the breadth-first and depth-first search algorithms : DFS Algorithm
From the section: Shortest Time Search (Depth First Search). Understand the practical working of DFS algorithm by answering the questions. • What is the flow of DFS • How the search ingredients are used • How stack data structure is used...
Packt
Compare the breadth-first and depth-first search algorithms : Building Search Tree with Nodes
From the section: Shortest Time Search (Depth First Search). Build a sample search tree by answering the questions. • What is a node • What are the properties and methods of node class • How can nodes be used to build trees Build a...
Curated Video
Design a computer system using tree search and reinforcement learning algorithms : Coding up Your First Solution to CartPole-v0
From the section: Lights, Camera, Action – Building Blocks of Reinforcement Learning. In this section, we learn about the main building blocks of reinforcement learning, including the action space, the environment, and the rewards. To...
Packt
Compare the breadth-first and depth-first search algorithms : Queue Data Structure
From the section: Shortest Path Search (Breadth First Search). In this section, we will develop LinkedIn’s connection feature using Breadth First Search. We take the concepts of the earlier section forward and learn about queue and graph...
Packt
Compare the breadth-first and depth-first search algorithms : Do It Yourself
From the section: Shortest Path Search (Breadth First Search). In this section, we will develop LinkedIn’s connection feature using Breadth First Search. We take the concepts of the earlier section forward and learn about queue and graph...
Curated Video
Implement different search algorithms : BST from scratch - Search
From the section: Algorithms - Search and abstract data structures. This section is about Algorithms. You will learn about Bisection, Binary section etc. Add a search method to the BST class
Packt
Compare the breadth-first and depth-first search algorithms : DFS Versus BFS
From the section: Shortest Path Search (Breadth First Search). In this section, we will develop LinkedIn’s connection feature using Breadth First Search. We take the concepts of the earlier section forward and learn about queue and graph...
Packt
Compare the breadth-first and depth-first search algorithms : Introduction to LinkedIn Connection Feature
From the section: Shortest Path Search (Breadth First Search). In this section, we will develop LinkedIn’s connection feature using Breadth First Search. We take the concepts of the earlier section forward and learn about queue and graph...