Finding optimal no of clusters in MOPSO implementation of Wireless Sensor Networks.

Sequence Alignment (Needleman–Wunsch Algorithm using Dynamic Programming) for aligning sequences (words, sentences, DNA etc.)

The ripple-spreading algorithm for the shortest path tour problem

Study of the paper "On the Optimality of the Simple Bayesian Classifier under Zero-One Loss" by Domigos and Michael Pazzani of the University of California published for the "Machine Learning" international forum in 1997.

Trajectory tracking control via decentralized joint-level schemes. All the experiments are performed on a 2R manipulator.

Advanced Methods for Synthesis of Probabilistic Programs

Problem definition in classical PDDL (Planning Domain Definition Language) for the air cargo domain discussed in AIMA Book

Solving the Rubik's Cube using three different search strategies including Iterative Deepening Search, A Star Search, Iterative Deepening A Star Search. The searches were compared in terms of: Number of nodes expanded and Optimality.

Planning algorithms for different problems.