This page contains the zipped files of the source code used in the projects and other utilities.
There are two ways of constructing a software design.
One way is to make it so simple that are
obviously no deficiencies.
And the other way is to make it so complicated that there are no obvious deficiencies.
C.A.R HOARE
Therefore the main activity of programming is not the origination of new indipendent programs but in the integration, modification and explanation of existing ones. The source code says exactly the actions to be performed by the Computer, whereas the comments what is supposed to. Computers don't introduce order anywhere as much as they expose opportunities.
It is essential to understand WHY and WHEN an algorithm works and HOW can be modified to explore data captured from different resources.
The languages that have been used to develop the programs listed below include:
C,Java,Matlab.
It is essential to understand WHY and WHEN an algorithm works and HOW can be modified to explore data captured from different resources.
The languages that have been used to develop the programs listed below include:
C,Java,Matlab.
- " The conflict management in the Dempster and Shafer Theory of Evidence. "
This is the Matlab Library implemented for The Master Thesis project.
It includes all the scripts listed and mentioned in the document dempster.pdf . |
|
- " A Matlab Library for Vehicle Routing problems. "
This is the Matlab Library implemented during the Metaheuristic course hold by Arne Lokketangen in the year 2012 at Roma Tre University. It includes some scripts for Vehicle Routing algorithms (Clark & Wright saving algorithm and Tabu Search) and a GUI for visualizing the graph.
|
|
- "Abstract Data Type Utilities built in C. "
Utilities built in C for ADT structures:
SLL (Simply Linked List) ,DLL (Doubly Linked List) and BST (Binary Search Tree).
In particular, I implemented a possible way to draw the tree structure using the command window terminal. It still have some bugs, but I'll fix soon.
SLL (Simply Linked List) ,DLL (Doubly Linked List) and BST (Binary Search Tree).
In particular, I implemented a possible way to draw the tree structure using the command window terminal. It still have some bugs, but I'll fix soon.
|
|
|