<table border="0"> <tbody> <tr valign="top"> <td style="padding-right: 5px;" width="80%"> <center> ---+++ <font color="blue" size="+4">Network Algorithms</font> ---+++ <font color="blue" size="+3">Algoritmi per le Reti </font> ---+++ <font color="blue" size="+3"> A.y./A.A. 2023/24</font> ---+++ <font color="blue" size="+3"> Prof. Tiziana Calamoneri</font> </center> </left> ---+++ <font color="blue" size="+1"> *Notices/Avvisi* </font> *A.Y. 2023/24:* *STUDENT LESSON:* The student lessons should be organized according to the following guidelines: * time: no less than 15 and no more than 20 minutes * teaching medium: at your choice (slides, blackboard, nothing, ...) * it is requested NOT to add a summary of what already studied * it is requested to give the intuition of ideas under the whole paper * it is appreciated at least one proof (whenever possible) * it is allowed to add original examples and in-depth analyses read on other papers On Thursday 19 October, instead of a usual lesson, there will be a seminar from Prof. Jan Arne Telle - University of Bergen - https://www.uib.no/en/persons/Jan.Arne.Telle You are very encouraged to attend it. <!-- *IMPORTANT!!* please, choose asap the paper for your students' lesson and drop me an email with your choice! The schedule will take into account the order of the program sections (so, papers concerning part 1 of the program will be scheduled before than papers concerning parts 2 and 3) If possible, each student should choose a paper from a different program section. Details on the schedule will be given here: https://twiki.di.uniroma1.it/twiki/view/Algoreti/ProgrammaLezioniDegliStudenti --> <center> <br /> <img alt="computer_network.jpg" height="300" src="%ATTACHURLPATH%/rete.jpg" width="400" /> </center> <!-- The exams of the Fall session (September) will be still held online. Please be prepared with all the necessary equipment, as explained in this page: https://www.uniroma1.it/en/documento/extraordinary-procedure-online-exams-due-current-covid-19-medical-emergency Please read carefully those guidelines, paying special attention to the sections "Preconditions", "Exam preparation", "Exam procedures". All the students that will register successfully for the exam on Infostud will receive an email with further details. --> <left> Dear students, during the algorithm courses you have already attended, you have been told that algorithms in general, and graph algorithms in particular, are important because they are able to model the solution of a number of real life problems: designing a good algorithm turns often out to have a good solution for the initial problem. Nevertheless, probably nobody detailed you which are these real life problems. During this course I will show you many real life problems arising from using communication networks (cable or wireless networks, fixed or mobile networks) and, for each of them, we will discuss together how a problem can be modeled as a classical graph problem and solved by means of a graph algorithm, proposing sometimes more than one solution. In the first part of the course, I will propose some classical problems (together with their algorithmic solutions). In the second part of the course, I will deal with some advanced problems, especially related with wireless, ad hoc and sensor networks. Of course, these latter problems are particularly feasible to be studied in a master thesis, with good possibilities to find some new results. It is worth to be noted that the approach of the course is algorithmic, so a special accent is posed on the method used to find the optimal solution or, at least, the best possible one. This means also that you should have knowledge of non trivial algorithms and data structures in order to attend this course with profit. --- Cari ragazzi, nei corsi di algoritmi che avete seguito vi è stato certamente detto che gli algoritmi in generale, e gli algoritmi su grafi in particolare, sono importanti perché possono modellare tanti problemi della vita reale ed avere un buon algoritmo per un problema su grafi significa spesso avere una buona soluzione per il relativo problema reale. Ma di quali siano in concreto questi problemi reali non si è quasi mai parlato. Ebbene, quello che invece cercherò di fare in questo corso è mostrarvi molti problemi "reali" che nascono dall'utilizzo di reti di comunicazione di vario tipo (cablate e senza fili, fisse e mobili) e, per ciascuno di essi, discuteremo come sia possibile modellarlo tramite un problema algoritmico classico e proporre quindi una o più soluzioni. Nella prima parte del corso, vi proporrò delle problematiche (e rispettive soluzioni algoritmiche) classiche, e quindi legate essenzialmente alle reti cablate. Nella seconda parte, invece, tratterò di argomenti di ricerca attuale, specie nel campo delle reti wireless ad hoc e delle reti di sensori. In particolare questi ultimi argomenti, come è ovvio, saranno particolarmente adatti a diventare argomenti di tesi di ampio respiro e con buone prospettive di trovare dei nuovi risultati. L'approccio del corso sarà comunque algoritmico, e quindi si porrà particolare accento sul metodo con cui sia possibile trovare la soluzione ottima o, almeno, la più efficiente possibile. Ciò significa anche che, per seguire con profitto questo corso, dovreste conoscere algoritmi e strutture dati non banali. --- </left> ---+++ <font color="blue" size="+2"> *Timetable/Orario 2023/24 I semest.* </font> | *Monday/lunedì* | 10.00 - 13.00 | Room: T1 (build. E) | | *Thursday/giovedì* | 14.00 - 16.00 | Room: T1 (build. E) | ---- ---+++ <font color="blue" size="+2"> *Office Hours/Ricevimento A.A. 2023/24 I semest.* </font> | Prof. Tiziana Calamoneri | Dept. of Computer Science/Dip. Informatica - via Regina Elena 295 - E building | write an e-mail to calamo@di.uniroma1.it (delete NOSPAM from the address) to get an appointment/per appuntamento inviando una e-mail a calamo@di.uniroma1.it - cancellare la scritta NOSPAM dall'indirizzo | </td> <td style="border-left: 1px solid gray; padding-left: 5px;" width="20%"> ---- %INCLUDE{"DateEsami"}% ---- ---+ <font color="blue" size="+2">Exam Procedure/[[Modalita' d'Esame]]</font> ---- ---+ <font color="blue" size="+2">Program and Textbook/[[Programma del Corso]] e libri di testo</font> ---- ---+ <font color="blue" size="+2">Lesson Diary/[[Diario delle Lezioni]]</font> ---- ---+ <font color="blue" size="+2">Lesson Slides/[[Slides delle Lezioni]]</font> ---- <!-- ---+ <font color="blue" size="+2">Remote Lessons/ [[Remote]]</font> ---- --> ---+ <font color="blue" size="+2">Student Lessons' Schedule/[[Programma Lezioni degli Studenti]]</font> </td> </tr> </tbody> </table>
This topic: Algoreti
>
WebHome1011
Topic revision: r150 - 2024-02-14 - TizianaCalamoneri
Copyright © 2008-2024 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki?
Send feedback