EECS4080

User Tools

Site Tools

You are here: EECS 4080.03, EECS 4081.06, EECS 4082.06, EECS 4084.06, EECS 4088.06, EECS 4090.06 and EECS 4480.03 » Proposed Projects for Winter 2016
Trace:
projects

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
Next revisionBoth sides next revision
projects [2015/08/26 21:57] – jarekprojects [2015/08/26 21:58] – jarek
Line 21: Line 21:
  
  
-=====Metaheuristic-based Optimization techniques=====+======Metaheuristic-based Optimization techniques======
  
-**Supervisor: Suprakash Datta**+**Supervisor:** Suprakash Datta
  
 Optimization is a crucial step in many computational problems. For computational problems that seem (or are known to be) intractable, metaheuristic-based techniques often work well in practice. These are typically randomized algorithms, often inspired by physical or biological systems. Examples of such algorithms include simulated annealing, genetic algorithms and ant colony optimization. In this project we will focus on particle swarm optimization (PSO), a technique inspired by the search for food by flocks of birds or schools of fish. Briefly, a set (or population) of candidate solutions (called particles) are maintained at all times by the algorithm. These particles move in the search-space using simple rules that make use of the best solutions found so far by the particle as well as by the swarm. Movement of particles result in new particles being generated. The process is repeated until some termination criteria are met and the best solution found is output by the algorithm. While there is no guarantee of optimality, PSO has been shown to produce good or very good solutions for many practical problems. Many variants of PSO's have been proposed. In this problem we will study the performance of some PSO variants on both artificial and real optimization problems. Optimization is a crucial step in many computational problems. For computational problems that seem (or are known to be) intractable, metaheuristic-based techniques often work well in practice. These are typically randomized algorithms, often inspired by physical or biological systems. Examples of such algorithms include simulated annealing, genetic algorithms and ant colony optimization. In this project we will focus on particle swarm optimization (PSO), a technique inspired by the search for food by flocks of birds or schools of fish. Briefly, a set (or population) of candidate solutions (called particles) are maintained at all times by the algorithm. These particles move in the search-space using simple rules that make use of the best solutions found so far by the particle as well as by the swarm. Movement of particles result in new particles being generated. The process is repeated until some termination criteria are met and the best solution found is output by the algorithm. While there is no guarantee of optimality, PSO has been shown to produce good or very good solutions for many practical problems. Many variants of PSO's have been proposed. In this problem we will study the performance of some PSO variants on both artificial and real optimization problems.
Line 35: Line 35:
 \\ \\
  
-=====Data visualization in Skydive=====+======Data visualization in Skydive======
  
-**Supervisor: Jarek Gryz**+**Supervisor:** Jarek Gryz
  
 Skydive is a prototype system designed for database visualization using a concept of the so called Skydive is a prototype system designed for database visualization using a concept of the so called
Line 69: Line 69:
  
 \\ \\
-=====Genome-wide identification of plant micro RNAs===== 
  
 +======Genome-wide identification of plant micro RNAs======
  
-**Supervisor: Katalin Hudak**+ 
 +**Supervisor:** Katalin Hudak
  
  
Line 116: Line 117:
  
 \\ \\
 +
 =====Dynamic Interface Detection and Control Project===== =====Dynamic Interface Detection and Control Project=====
  
projects.txt · Last modified: 2016/01/13 20:05 by stevenc