Algorithms development for financial problems

A challenging task, spanning across various industries in the modern world, is to solve complex practical problems classified as NP-hard. NP-hard stands for Non deterministic Polynomial-time hard. It represents a class of problems that are computationally intractable, implying that it is overwhelmin...

Full description

Saved in:
Bibliographic Details
Main Author: Vasudevan Prabhakaran
Other Authors: Lim Meng Hiot
Format: Final Year Project
Language:English
Published: 2009
Subjects:
Online Access:http://hdl.handle.net/10356/18371
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary:A challenging task, spanning across various industries in the modern world, is to solve complex practical problems classified as NP-hard. NP-hard stands for Non deterministic Polynomial-time hard. It represents a class of problems that are computationally intractable, implying that it is overwhelming to solve these problems within a traceable time period. The real challenge to solve such NP-Hard problems is in the algorithm front, to develop efficient algorithms that can be implemented within a limited time frame. The project focuses on the algorithm development process with the intent of solving such NP hard problems using an application known as ADEP – Algorithm Development Environment for Problem Solving. ADEP is a patented technology developed at Intellisys, a collaboration between ST Dynamics and NTU. In this project, the focus would be the development of documentations and promotional video targeted at the programmers and system integrators.