Private Instances of the PACE2019 Challenge
We published the private and public instances for both tracks on Zenodo. For details we refer to: 1) Instances from the Vertex Cover Track 2) Instances from both Hypertree Decomposition Tracks
Results of the 4th PACE Challenge
We published preliminary results of the PACE2019 challenge. The final results and winners will be announced during the award ceremony at IPEC2019 in Munich.
Deadline extension (solver description). New. June, 3rd (AOE)
Due to problems with the submission system easychair, we extend the deadline until Monday June 3rd, 2019 (AOE). We’ve been informed on May 30th that easychair is experiencing network problems which however should have already beenresolved on May 31st (see below). Nonetheless, due to several requests still reporting problems, we decided to extend the deadline further.
More …How to interpret Optil's status messages
Jan from optil.io informed us that their system sometimes gets stuck when a submission is killed due to reaching the time limit.
More …Optil issues resolved
The issue should be resolved.
More …Optil: Technical issues with submission system
We are currently experiencing some issues with the optil system. The problem was first reported yesterday. According to optil, they ran a system update. We are in contact with the optil team. Unfortunately, there is a public holiday on May 1st and May 3rd in Poland, so we might get answers not before Monday.
More …PACE 2019 Call for Participation
We are happy to announce the fourth iteration of PACE, the Parameterized Algorithms and Computational Experiments Challenge. The goal of PACE is to investigate the applicability of algorithmic ideas studied and developed in the subfields of multivariate, fine-grained, parameterized, or fixed-parameter tractable algorithms. This year, the challenge consists of two separate tracks.
More …PACE 2018 ceremony at IPEC
The award ceremony took place in Helsinki. The slides are available and show the results.
More …PACE 2018 now on OPTIL.io
We are happy to announce that PACE 2018 will cooperate again with OPTIL.io to handle the submission process and the evaluation of the submissions. OPTIL.io is a website for organizing programming challenges on optimization problems, created and maintained by the Institute of Computing Science of Poznan University of Technology.
More …PACE 2018 Call for Participation
The PACE 2018 challenge has started! This year there is only one problem, Steiner Tree, and three tracks: two for exact algorithms and one for heuristics. To register your team now and find out all the details of the challenge, visit the challenge page.
Extension of submission deadline
Due to numerous requests, we decided to allow submissions for Track A and Track B until May 25. Thanks to the cooperation with OPTIL.io, we can still send out the notification on June 1.
More …PACE is cooperating with OPTIL.io
March 1 has passed which means that submission is possible from now until May 1 for both tracks of PACE 2017.
More …PACE 2017 Announcement
We are happy to announce the second iteration of PACE, the Parameterized Algorithms and Computational Experiments Challenge. The goal of PACE is to investigate the applicability of algorithmic ideas studied and developed in the subfields of multivariate, fine-grained, parameterized, or fixed-parameter tractable algorithms. The challenge consists of two separate tracks.
More …Results of the First PACE Challenge
The winners of the 1st PACE competition were presented at ALGO 2016 in Aarhus. For those that couldn’t make it to Aarhus: here are the results. We would like to thank all participants for making this 1st edition of PACE an enjoyable and successful one.
More …Challenge Prizes and Travel Awards
Thanks to the generous support of the NWO Gravitation project NETWORKS, we can announce the following awards for the first PACE challenge.
More …The First PACE Challenge
The goal of the Parameterized Algorithms and Computational Experiments Challenge (PACE) is to investigate the applicability of algorithmic ideas studied and developed in the subfields of multivariate, fine-grained, parameterized, or fixed-parameter tractable algorithms. In particular, it aims to
More …