This category contains 104 posts

SACT Seminar: Justified Representation in Approval- Based Committee Voting

Time: 1:00 pm Tuesday, 28th February 2017. Location: SIT 459 Speaker: Haris Aziz, Data61/CSIRO and UNSW Title: Justified Representation in Approval- Based Committee Voting Abstract: We consider approval-based committee voting, i.e. the setting where each voter approves a subset of candidates, and these votes are then used to select a fixed-size set of winners (committee). … Continue reading

SACT Seminar: Computing the Yolk in Spatial Voting Games

Time: 1:00 pm Wednesday, 22nd February 2017. Location: SIT 459 Speaker: Jonathan Chung, University of Sydney Title: Computing the Yolk in Spatial Voting Games Abstract: The spatial model of voting describes a set of voters with Euclidean preferences on a multidimensional space of policies. A game within this model can be played as follows: given … Continue reading

SACT Seminar: Reduction of the Radius of a Graph by Adding Edges

Time: 1:00 pm Tuesday, 14th February 2017. Location: SIT 459 Speaker: Michael Rizzuto, University of Sydney Title: Reduction of the Radius of a Graph by Adding Edges Abstract: Given a graph and a maximum number of extra edges, we wish to find the minimum radius achievable by adding these edges to the graph. A solution … Continue reading

SACT Seminar: Approximation Algorithms for 2D Barrier Coverage

Time: 1:00 pm Tuesday, 7th February 2017. Location: SIT 459 Speaker: Andrew Cherry, University of Sydney Title: Approximation Algorithms for 2D Barrier Coverage Abstract: Given barriers represented by line segments and sensors with circular radius initially located in arbitrary locations we want to move a group of sensors to arbitrary locations on the barriers so … Continue reading

SACT Seminar: Algorithms for robot navigation

Time: 11:00 am Friday, 16th December 2016. Location: SIT 459 Speaker: Prof. Sándor Fekete, TU Braunschweig Title: Algorithms for robot navigation: From optimizing individual robots to particle swarms Abstract: Planning and optimizing the motion of one or several robots poses a wide range of problems. What positions should one powerful robot pick to scan a … Continue reading

SACT Seminar: Colouring on hereditary graph classes

Time: 12:00 noon Tuesday, 8th November 2016. Location: SIT 459 Speaker: Shenwei Huang, UNSW Title: Colouring on hereditary graph classes Abstract: A graph class is hereditary if it is closed under taking induced subgraphs. It is known that hereditary classes can be characterized by forbidden induced subgraphs. We survey some recent complexity results on colouring … Continue reading

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.

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

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

Join 59 other followers