New and past projects I have been involved with. Here I will also make reference to some academic projects I worked for while at university.
Currently: Technical Support Engineer at Symantec
Past: HCL Technologies, Critical Software, PT Inovação (check my CV for details)
Project Management Laboratory
Title: Wedit, a WYSIWYG live webpage editor
When: 2006/2007 2nd semester
Grade: 17/20 points (best graded project in this semester)
Using: HTML, Javascript
Short description: Implementation of a web site editor in Javascript, pluggable into any previously existing HTML page, that turns it into an editable page. Each item will keep the same look until clicked.
Databases Laboratory
Title: GADUP Management Portal
When: 2005/2006 2nd semester
Grade: 18/20 points
Using: PHP, Smarty template engine, PostgreSQL
Short description: Implementation of a web site for the GADUP (University of Porto Sports Activities) to monitor activities, participants and instructors.
Logic Programming
Title: The Hexxagon Game
When: 2005/2006 1st semester
Grade: 16/20 points
Using: SICStus Prolog
Short description: Artificial intelligence module in Prolog for the Hexxagon game.
Title: Packing problems
When: 2005/2006 1st semester
Grade: 17/20 points
Using: SICStus Prolog
Short description: Packing problems are related to choose the best way to accommodate a number of items in a given physical space. This project used 2D shapes.
Agents and Distributed Artificial Intelligence
Title: MultiAgent system for the waste collecting in a Virtual City
When: 2006/2007 1st semester
Grade: 16/20 points
Using: Java, JADE agent framework
Short description: Several trucks (the agents) collaborate in collecting different kinds of waste in a city. They start with no knowledge of each other, the city roads or its waste drop-points and quickly start collaborating, warning when they find waste that needs collecting.
- The trucks have a limit vision radius
- The trucks have memory
- The trucks only collect one type of waste
- The trucks have a maximum capacity of waste they can carry.
- The trucks see each other and avoid bumps
- The trucks communicate if they find waste they cannot collect (not its type or maximum capacity reached)
- They always take the shortest path.