Optimization Techniques for Computer Science
Home » Teaching » Optimization Techniques for CS
This page summarize projects submitted and reports and presentation from students for the Optimization Techniques for Computer Science lecture.
Spring 2009 [top]
You can check the Optimization Techniques for Computer Science '09 website on Moodle (login required).
I proposed two joint subjects with Apivadee Piyatumrong entilted Network Communities and Spanning Trees and Volatility of Communication Edges to Construct Robust Trusted Spanning Forests.
Network Communities and Spanning Trees [top]
Project proposals:
Student report:
Detection of communities in Ad hoc Networks and Robust Spanning Trees
Final report, by Laurent Kirsch and Sandy Kirtz. (592.528 kb)
Network Communities and Robust Spanning trees in MANETs
Final presentation, by Laurent Kirsch and Sandy Kirtz. (1.750205 Mb)
Volatility of Communication Edges to Construct Robust Trusted Spanning Forests [top]
Project proposals:
Volatility of Communication Edges to Construct Robust Trusted Spanning Forests
Project proposal. (67.307 kb)
Volatility of Communication Edges to Construct Robust Trusted Spanning Forests
Project presentation. (8.670733 Mb)
Student report:
Volatility of Communication Edge to the Robustness of Trusted Spanning Forest
Final report, by Georges Toth. (1.564257 Mb)
Volatility of Communication Edge to the Robustness of Trusted Spanning Forest
Final presentation, by Georges Toth. (1.821936 Mb)