| Department of Computer Science - Daimi |
|
| Home | Contact | Research | Courses | Curriculum | Library | Local | Search |
CAGT seminar, Vangelis Markakis, CWIWednesday 13. of February 2008
Title: Algorithms for Computing Approximate Nash Equilibria in Bimatrix GamesSpeaker: Vangelis Markakis, CWI Time: Wed Feb 13th 2008 14:15-16:00 Location: ADA-333 Abstract: A Nash equilibrium of a noncooperative game is a pair of strategies such that no player has an incentive to unilaterally deviate from his current strategy. Recent results (e.g. Daskalakis, Goldberg, Papadimitriou '06 and... MADALGO Seminar: Ian Munro, University of WaterlooThursday 14. of February 2008
Titel: Integer Representation and Counting in the Bit Probe ModelSpeaker: Ian Munro, University of Waterloo Abstract: We examine the problem of integer representation in near minimal number of bits so that the increment and the decrement (and indeed the addition and the subtraction) operations can be performed using few bit inspections and fewer bit changes. In particular, we prove a new lower... MADALGO Seminar: Norbert Zeh, Dalhousie UniversityFriday 15. of February 2008
Titel: A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengthsSpeaker: Norbert Zeh, Dalhousie University Abstract: We present a cache-oblivious algorithm for computing single-source shortest paths in undirected graphs with non-negative edge lengths. The algorithm incurs O(v(nm log w)/B+(m/B) log n +MST (n, m)) memory transfers on a graph with n... |
Upcoming eventsno news in this list. |
|
Responsible: Mads Kirkedal Henriksen
Dynamic generated page |