Giter Club home page Giter Club logo

shaarif's Projects

panoramart icon panoramart

Data from six museums across California was integrated by performing various data cleaning, schema matching and record linkage steps etc. on the scraped data of each museum's website using Google Refine. Created the Ontology for the data and hence Developed a web based application, which allows the art lovers to search and locate conveniently the artwork of their choice.

propositional-logic-inference-algorithm icon propositional-logic-inference-algorithm

Program to implement various inference algorithms for propositional logic (PL). The aim of logical inference is to decide whether KB ⊨ α for some sentence α. Following 3 specific inference algorithms are implemented 1) PL Forward chaining. 2) PL Backward chaining. 3) PL Resolution. The KB is given in the implication form of Horn clauses. Thus, it is necessary to convert KB into CNF form for task 3.

reversi icon reversi

Program to play the Reversi game using Minimax and Alpha-Beta pruning algorithms with two different evaluation functions: 1) number of pieces 2) positional weights. The rules of the Reversi game can be found e.g. in http://en.wikipedia.org/wiki/Reversi [1]. The interactive examples can be found e.g. http://www.samsoft.org.uk/reversi/[2]. In the Othello version of this game, the game begins with four disks placed in a square in the middle of the grid, two facing light-up, two pieces with the dark side up, with same-colored disks on a diagonal with each other. However, the starting position will be specified in the input file. Program to implement the following algorithms for both min and max players. 2.1 Minimax using number of pieces as an evaluation function ; 2.2 Alpha-Beta pruning using number of pieces as an evaluation function ; 2.3 Alpha-Beta pruning using positional weights as an evaluation function.

search-algorithms icon search-algorithms

Program that will apply Breadth-first search, Depth-first search and Uniform-cost search to find a path between two specific nodes.

tsp icon tsp

Program to solve the Euclidean traveling salesman problem using Greedy and A* search algorithm with two heuristics: 1) straight line distance 2) minimum spanning tree.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.