>
archives

Announcements

This category contains 108 posts

Sydney Algorithms Workshop 2016

Together with UNSW’s algorithms group the SACT group will organise a pre-ISAAC algorithms workshop.  The focus of the workshop will be Fixed Parameter Computational Geometry. Advertisements

SACT Seminar: On the Parameterized Complexity of Belief Revision

Time: 12:00 noon Tuesday, 11th October 2016. Location: SIT 459 Speaker: Stefan Rümmele, University of Sydney Title: On the Parameterized Complexity of Belief Revision Abstract: Belief revision is a core formalism of Artificial Intelligence aiming for a formal way of adapting one’s beliefs in the light of new information. Parameterized complexity is a well recognized … Continue reading

SACT Seminar: On the Complexity of Connection Games

Time: 12:00 noon Tuesday, 6th September 2016. Location: SIT 459 Speaker: Abdallah Saffidine, UNSW Title: On the Complexity of Connection Games Abstract: Invented in 1942, Hex is a strategy game with a lasting influence in board game design as well as in computer games research. In the first part of this talk, we study three … Continue reading

SACT Seminar: Fast Algorithms for Diameter-Optimally Augmenting Trees

Time: 12:00 noon Tuesday, 16th August 2016. Location: SIT 459 Speaker: Joachim Gudmundsson, University of Sydney Title: Fast Algorithms for Diameter-Optimally Augmenting Trees Abstract: We consider the problem of augmenting an n-vertex graph embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the resulting graph. We present … Continue reading

SACT Seminar: Cartesian Tree of Tree Algorithms

Time: 1:00pm Tuesday, 31st May 2016. Location: SIT 459 Speaker: Natalie Tridgell, University of Sydney Title: Cartesian Tree of Tree Algorithms Abstract: We study the problem of constructing a cartesian tree of a tree.  We present two new algorithms for computing a cartesian tree of a tree.  We will look at worst case scenarios for … Continue reading

SACT Seminar: Compact Flow Diagrams for State Sequences

Time: 1:00pm Tuesday, 17th May 2016. Location: SIT 459 Speaker: Michael Horton, University of Sydney Title: Compact Flow Diagrams for State Sequences Abstract: We introduce the concept of compactly representing a large number of state sequences, e.g., sequences of activities, as a flow diagram. We argue that the flow diagram representation gives an intuitive summary … Continue reading

SACT Seminar: A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents

Time: 1:00pm Tuesday, 3rd May 2016. Location: SIT 459 Speaker: Simon Mackenzie, Data61 Title: A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents Abstract: We consider the well-studied cake cutting problem in which the goal is to find an envy-free allocation based on queries from the agents. The problem has received … Continue reading

SACT Seminar: Scheduling problems in synchronous data flow programming

Time: 1:00pm Tuesday, 19th April 2016. Location: SIT 459 Speaker: Julian Mestre, University of Sydney Title: Scheduling problems in synchronous data flow programming Abstract: We study a scheduling problem arising in the execution of synchronous data flow programs. We propose three objective functions capturing the memory usage of a program under different memory management schemes. … Continue reading

SACT Seminar: Exact Algorithms via Monotone Local Search

Time: 1:00pm Tuesday, 5th April 2016. Location: SIT 459 Speaker: Serge Gaspers, UNSW / Data61 Title: Exact Algorithms via Monotone Local Search Abstract: We give a new general approach for designing exact exponential-time algorithms for subset problems. In a subset problem the input implicitly describes a family of sets over a universe of size n … Continue reading

SACT Seminar: Quantum matching problems

Time: 1:00pm Tuesday, 22nd March. Location: SIT 459 Speaker: Youming Qiao, UTS Title: Quantum matching problems Abstract: We describe two algorithmic problems, both of which can be viewed as quantum analogues of the perfect matching problem on bipartite graphs. Given several square matrices, we are asked to: (1) decide if there is a full-rank matrix in … Continue reading

Enter your email address to subscribe to receive notifications of new announcements by email.

Join 68 other followers