ColinTheMathmo, to random
@ColinTheMathmo@mathstodon.xyz avatar

More information about this:

https://mathstodon.xyz/@ColinTheMathmo/111179219517536920

My previous counting had an error, so I'm reposting.

I want to create a schedule with as few clashes as possible ... a perfect tournament is clearly impossible via pigeonhole.

Counting a clash as

  • Being paired with the same player twice
  • Playing against the same player twice

I now have a tournament with 19 clashes. Which is an odd number in both senses.

Can anyone do better?

I'll recap the details in a reply to this post.

ColinTheMathmo,
@ColinTheMathmo@mathstodon.xyz avatar

I'd be really happy if people boosted this for reach, but I think I'm pretty much done now. I'm sure this has been done to death elsewhere, but nothing I've read seems to be easily adaptable to this context. If feels like it's just a but minimisation problem with lots of nasty combinatorics.

#ConstraintProgramming
#Optimisation
#Combinatorics
#Tournament

anna, to foss
@anna@mathstodon.xyz avatar

Last week, I presented the work I did with prof. Kuldeep Meel and prof. Arunabha Sen at IJCAI 2023.

We showed the benefits of reducing a problem to a computationally harder problem (yes, you read that right!), by demonstrating how it allows us to solve much larger problem instances.

It was so much fun to finally share this work with so many fantastic researchers at IJCAI! Thank you to all organisers for making this conference possible. I'm also super grateful to the reviewers who gave us great feedback!

Please find our paper, slides, poster, a short video, and our open source tool, gismo, here: www.annalatour.nl/publication/2023-08-01-Solving-the-Identifying-Code-Set-Problem-with-Grouped-Independent-Support

Me, a young woman with long blonde hair wearing a pink blouse, standing in front of an academic poster, smilingly posing as if I am explaining it to someone. The poster is titled "Solving the Identifying Code Set Problem with Grouped Independent Support", and has a big pink block with white letters in the middle, which reads "by reducing to a computationally harder problem, we can exponentially decrease the encoding size, and solve much larger instances."

anna, to ai
@anna@mathstodon.xyz avatar

Hi fellow academics! I was wondering if y'all can give me some feedback on the poster I am working on for IJCAI (https://ijcai-23.org/)? I'm playing a bit with the design and how to make it attractive.

I'm attaching two screenshots. My questions are about the big eye-catcher in the middle. If you have a minute, can you please let me know what you think?

  1. Do you get the reference?
  2. Does the effort to make the reference distract you?
  3. Do you think that the text in the big pink box has NSFW vibes?
  4. Does the text in the big pink box help to pique your interest in the poster?

Thanks!

Close-up of the big fuchsia box.

cp2023conf, to random

Check out CP2023's Call for DEI scholarship: https://cp2023.a4cp.org/cfdei.html

Deadline: 31 July 2023

The scholarship is intended for early-career researchers who have historically been underrepresented, for instance in terms of geographical region, cultural background, gender identity, and disability.

#CP2023conf #ConstraintProgramming #BlackInSTEM #DisabilityInclusion #WomenInSTEM #QueerInAI #LatinxInSTEM #DiversityAndInclusion #DiversityInSTEM #WomenInTech #AcademicMastodon #PhDLife #PostdocLife

  • All
  • Subscribed
  • Moderated
  • Favorites
  • megavids
  • osvaldo12
  • DreamBathrooms
  • mdbf
  • InstantRegret
  • ngwrru68w68
  • magazineikmin
  • everett
  • thenastyranch
  • Youngstown
  • slotface
  • cisconetworking
  • kavyap
  • ethstaker
  • JUstTest
  • modclub
  • GTA5RPClips
  • khanakhh
  • tacticalgear
  • Durango
  • rosin
  • normalnudes
  • Leos
  • provamag3
  • tester
  • cubers
  • anitta
  • lostlight
  • All magazines