Dear VisitorThanks for choosing FOCS Lab as your
academic laboratory. Foundations of Computer Science Laboratory (FOCS
Lab) is the First scientific lab in Department of Computer Science at
Shahid Bahonar University of Kerman.
We have many plans to run in
our lab which it is better to announce later on as you accompany us! We hope the FOCS Lab
to be an good opportunity as well as a freindly community for all CS
students, collegers and anyone who loves CS! Hope to all will be in
practice!
Finally, it is obvious that we can not meet the goals
above without your constructive comments and views. We always wait
hearing words from you, even just now!! Thanks your time and
consideration
Best Wishes
+ نوشته شده در ساعت توسط saeed
|
FOCS originally stands for The Annual IEEE Symposium on Foundations of Computer Science. Here is what wikipedia knows about FOCS, an academic conference in Theoretical Computer Science
+ نوشته شده در ساعت توسط saeed
|
--- Was Held --- Thanks for your attendance ---
Date and Time: Wednesday, 8 Mehr 88 (30 Sept. 2009),
10:55 - 11:30 AM
Place: Seminar J, J Building
We wiil shortly talk about FOCS Lab: mission and vision. The talk will also includes the answer to those questions you asked about FOCS Lab, sorry for delay in answers! We appreciate your time and kindly invite you for session attendance. Thank you
+ نوشته شده در ساعت توسط saeed
|
--- Was Held --- Thanks for your attendance ---
Seminar
Title: Introduction to Approximation Algorithms
Speaker: Saeed Mehrabi
Date and Time: Tuesday, 14 Mehr 88 (6 Oct. 2009)
8:50 - 9:30 AM
Place: Computer Site J, J Building
Abstract
Many important problems in theoretical computer science belongs to the class of NP-Complete problems which means that there is no efficient polynomial time algorithm for solving them. Due to importance of these problems in application, specially Traveling Salesman Problem (TSP), scientists focused their attention on algorithms for finding solutions near to optimal solution in polynomial time. Algorithms which today are famous as Approximation Algorithms. In this talk, we give an introduction to these algorithms along with an example, Vertex Cover Problem.
+ نوشته شده در ساعت توسط saeed
|
+ نوشته شده در ساعت توسط saeed
Mail: Department of Computer Science, 3rd floor of J Building,
Shahid Bahonar University of Kerman, 22-Bahman Blvd., Kerman,
Iran.
E-Mail: mehrabi235@gmail.com
+ نوشته شده در ساعت توسط saeed
