CourseNana | Algorithm

EECS 492 Introduction to Artificial Intelligence: Designing Agents, Search Tree, Brick Sorting Machine, Heuristics and Hill Climbing

EECS492Introduction to Artificial IntelligenceDesigning AgentsSearch TreeBrick Sorting MachineHeuristics

Tic - tac - toe is a game for two players who take turns marking the spaces in a three - by - three grid with X or O. The game’s objective is to be the first in placing three of their markers in a horizontal, vertical, or diagonal row (see Figure 1). **Figure 1**: A game of Tic - Tac - Toe where the O player has won, as it has three markers in a diagonal row. You are now tasked with developing an AI algorithm for a tic - tac - toe agent. The agent is a robot that can play against another agent (human or robot) on a piece of paper using a pen.

CSC373 Algorithm Design, Analysis and Complexity F24: Divide and conquer, Dynamic Programming

CSC373Algorithm Design Analysis and ComplexityDynamic programmingBellman equationDivide and conquer algorithm

Using your recurrence from the previous question, give a dynamic programming algorithm to compute the smallest possible total tension of a set S of k GRS members that includes the president (root of the tree). Your algorithm should run in time polynomial in the total number of GRS members n. Give pseudocode for your algorithm, and analyze its worst case running time.

COMPSCI 367 Artificial Intelligence Assignment 2: PDDL

COMPSCI 367Artificial IntelligencePDDLPrologvariable elimination algorithm

For this question, you are asked to solve a classical planning problem using PDDL. Read the problem description carefully. Polynesian navigators trained in schools (wānanga) to learn a body of wayfinding techniques that provided the skills necessary to travel to other locations throughout the Pacific, including over vast distances.

Computer Science 21A (CS21A) - Data Structures and Algorithms - Programming Assignment 0: Up and Down

Computer Science 21AData Structures and AlgorithmsBrandeisJavaElevator

In this assignment, you will be simulating a building that contains a single elevator. However, this elevator is somewhat simplified: it only moves a person to a floor and then the person will remain on that floor forever. That is, the elevator cannot pick people up from any floor besides the lobby.

COMP SCI 3004/7064 Operating Systems Practical 2 - Virtual Memory Simulation

COMP SCI 3004COMP SCI 7064COMP3004Operating SystemsCOMP7064Virtual Memory Simulation

By doing this practical work, you will learn how to implement page replacement algorithms, gain experience in creating and evaluating a simple simulator, and develop your skills in scientific writing.

FIT2004 Algorithms and data structures 2024 Semester 2 Assignment 1 - Two-Gather

FIT2004Algorithms and data structuresPythonTwo-GatherGraphOptimal Route Planning

You and your friends have just recently moved to a new city in order to further your studies. Before coming over, you all made a pact – to never do anything alone. Thus wherever you go, you should always go with someone. Unfortunately due to budget constraints, you are all living separated all over the city. Besides that, none of your friends own a vehicle, so they need to commute by train.

COMP9417 - Machine Learning Homework 2: Bias, Variance and an application of Gradient Descent

COMP9417Machine LearningPythonBiasVarianceGradient Descent

In this homework we revisit the notion of bias and variance as metrics for characterizing the behaviour of an estimator. We then take a look at a new gradient descent based algorithm for combining different machine learning models into a single, more complex, model.

Machine Learning Fundamentals Group Assessment: Model comparison

Machine LearningRMSEFeature EngineeringKNNRegression

Background Information Kevin is a professional real-estate manager. In the past, he relied on using a few important features for home valuation. His boss recently asked him to take the initiative to learn to use big data and machine learning algorithms to value home prices in order to better communicate with customers.

1122 Introduction to AI Assignment 3: Solve the assignment problem using local and global search algorithms

Introduction to AICC++Search Algorithm

So far, we have learned lots about search. A common problem with many real-world applications is the assignment problem, which can be defined as follows. Given a set of agents 𝒜, a set of tasks M, and a profit function F: 𝒜 × M → R, assignment problem is to find an assignment for each agent to a unique task such that the total profit is maximized. Write a program to solve the assignment problem using local and global search algorithms.

Algorithm Assignment 2: Different Approaches to the Multicolored Clique Problem

Multicolored Clique ProblemBranch-and-BoundHill Climbing AlgorithmSimulated Annealing algorithm

The Multicolored Clique Problem (MCP) is defined as follows: Given an undirected graph where each vertex is assigned one of k colors, find a maximum clique (complete subgraph) where all vertices have different colors.