Lewis and Clark are so gay.
Pontus
- 67 Followers
- 208 Following
- 350 Posts
ne7Here's a little #amiga #protracker #chiptune of mine out the archives called Gimme Some Sugar - have an awesome sunshine filled Saturday peeps ❤️
HoffmanIt's wednesday.. I'm live.. and I'm still coding that main menu. #amiga #gamedev #68000
http://twitch.tv/djh0ffman
http://twitch.tv/djh0ffman
George Takei 
🏳️🌈🖖🏽
Kris 
cat game
look at this cat
you won!!!
SanderFocusSome workstages
This fab documentary just hit Youtube <3
Insert Coin (2020) detailing the history of Williams/Midway's NARC / MK era arcade development. a great watch!
https://youtu.be/7zx5GunyUS4?si=lFrh4n4PIt-iOnhu
#arcade #midway #williams #nbajam #mortalkombat #NARC #gamedevelopment #history
Insert Coin - Full Feature Length Documentary
Aras Pranckevičius"No CPU, no GPU, no memory" demo category is cool! You actually make an ASIC that outputs a VGA signal. My friend ReJ just made one. "The Drop", 3.5k logic gates, displays pictures and plays muzak. Submitted to Tiny Tapeout. Source: https://github.com/rejunity/tt08-vga-drop
Parent concern: will a college degree be useful in the apocalypse?
Athena L.M.POLYCULE DATE SCHEDULING FOUND TO BE NP-HARD
Polyamorous Scheduling
Finding schedules for pairwise meetings between the members of a complex social group without creating interpersonal conflict is challenging, especially when different relationships have different needs. We formally define and study the underlying optimisation problem: Polyamorous Scheduling. In Polyamorous Scheduling, we are given an edge-weighted graph and try to find a periodic schedule of matchings in this graph such that the maximal weighted waiting time between consecutive occurrences of the same edge is minimised. We show that the problem is NP-hard and that there is no efficient approximation algorithm with a better ratio than 4/3 unless P = NP. On the positive side, we obtain an $O(\log n)$-approximation algorithm; indeed, a $O(\log Δ)$-approximation for $Δ$ the maximum degree, i.e., the largest number of relationships of any individual. We also define a generalisation of density from the Pinwheel Scheduling Problem, "poly density", and ask whether there exists a poly-density threshold similar to the 5/6-density threshold for Pinwheel Scheduling [Kawamura, STOC 2024]. Polyamorous Scheduling is a natural generalisation of Pinwheel Scheduling with respect to its optimisation variant, Bamboo Garden Trimming. Our work contributes the first nontrivial hardness-of-approximation reduction for any periodic scheduling problem, and opens up numerous avenues for further study of Polyamorous Scheduling.