Algorithm Design with Knowledge: Secretaries and Prophets
In this talk, we consider more efficient algorithm design when wehave some knowledge about the input instance. Knowledge such asstructure of the input or input distributions can be used to designmore efficient algorithms especially for practical scenarios. Thisis in contrast to the worst case analysis that hardly may happen inreal-world.
To give examples of such algorithms, in particular we consider twopopular versions of online selection problems - secretary problemsand prophet inequalities. In both of these problems, elements of aset are revealed one at a time and we have some knowledge about thedistribution of the input. When an element is revealed, we mustimmediately and irrevocably decide whether to accept, but forgoingthe opportunity to see the remaining elements, or reject, bypassingthe element forever (but we still see future elements). We coverseveral extensions of these popular online selection problems incomputer science which are mainly followups of two pioneering worksof the speaker.
Mohammad Hajiaghayi is the Jack and Rita G.Minker Professor in Computer Science Department at the University of Maryland, College Park. He is also Affiliate Professor in the Decision, Operations, and Information Technologies Area of the University of Maryland Robert H. Smith School of Business. His main area of research is designing algorithmic frameworks for complex networked systems. In particular, he designs efficient approximation algorithms, fixed-parameter algorithms, game theory algorithms, and streaming algorithms for big and complex networks, and often tests them in real-world and practical situations. He is a recipient of the European Association for Theoretical Computer Science (EATCS) Nerode Prize (2015), University of Maryland Graduate Mentor of the Year Award (2015), ONR Young Investigator Award (2011), NSF CAREER Award (2010), and Google Faculty Research Award (2010 & 2014), and a few other grants. In the course of his professional career, he has published over 200 papers with over 190 co-authors, received a few best paper awards, and served on program committees or editorial boards of several well-known international computer science conferences and journals. In particular he was/is the program committee chair for IFIP TTCS'15 as well as ACM SPAA'17. He has 10 granted and 2 filed US patents and has given over 60 invited talks around the world, and organized several workshops and tutorials. Last but not least he holds Silver Medal in 9th International Olympiad in Informatics (IOI'97) and awarded the best undergraduate prize of Sharif CE department in 2000 (for his highest GPA).
دکتر مهدیبرادران طهوری
استاد دانشگاه صنعتی کارلسروهه، آلمان
چهارشنبه، 7 مهر، ساعت 14
طبقه چهارم دانشکده مهندسی کامپیوتر، سالن خوارزمی
Computing Systems and Architectures: Past, Present, and Future
Computing systems have become the integral part of our daily lives, from financial sectors to medical systems, from automotives to avionics, from personal entertainment to handheld devices, we rely on computers for almost everything. This has been enabled by the progress in the technology, devices and circuits, architectures and systems, and algorithms and software. This talk will overview this trend and looks back at the progress in computing architectures and systems. Also, we look into the exciting new computing technologies, architectures and paradigms which will fuel this progress over the next decades in emerging application domains.
Mehdi Tahoori is a full professor and Chair of Dependable Nano-Computing (CDNC) at the Institute of Computer Science & Engineering (ITEC), Department of Computer Science, Karlsruhe Institute of Technology (KIT), Germany. He is also an adjunct professor of Electrical and Computer Engineering at Northeastern University, Boston, USA. He received his PhD and M.S. degrees in Electrical Engineering from Stanford University in 2003 and 2002, respectively, and a B.S. in Computer Engineering from Sharif University of Technology in Iran, in 2000. In 2003, he joined the Electrical and Computer Engineering Department at the Northeastern University as an assistant professor where he promoted to the rank of associate professor with tenure in 2009. During 2002 to 2003, he was a research scientist at Fujitsu Labs of America working on reliability issues in deep sub-micron VLSI designs. In addition to five pending and granted U.S. and international patents for his work, he has over 100 publications in major journals and conference proceedings on wide-ranging topics from dependable computing and emerging nanotechnologies to system biology. His research interests include nano computing, reliable computing, VLSI testing, reconfigurable computing, emerging nanotechnologies, and system biology. He was a recipient of National Science Foundation (NSF) Early Faculty Development (CAREER) award.