So, I was trying to read this paper, which referred a whole bunch to this PhD thesis, and the only related paper I could find was rather terse, and I figured I might as well go through the thesis. And this is a long thesis, and I got tired of all the math, especially with visiting a few people earlier, and arguing about stuff during hours, so I skip this section which I am assured is useless for most of the rest of the thesis, only to have to back track through half of it, some of the terse paper and such… Someone needs to make a better way to read these things, I should be able to double click and get DBLP or Google Scholar results. That being said, stochastic uncapacitated facility location problems don’t seem to throw many results anyways. Oh well, this was me generally complaining about the amount of backtracking theory papers seem to be requiring. That being said, I am working on fun stuff with CO, this could lead to some fun things.
Ze Panda
Me and Jacob were discussing possible languages to be included as a part of Wireshark’s mostly Turing complete filter language (Intercal and such were coming to mind), when we hit upon the idea of interpretive dancing as a language. Define a step to be the lambda operator, and everything else you can do is free [...]
Read more...
Hi people of the internet (or the subset of those who read this) and more importantly the Gods, owners and legislators of this unlegislated land While I am aware more important debates, such as ones concerning the ‘tubular nature of the internets’, the ongoing shift to IPV6, the failure of certain registrar’s and such is [...]
Read more...
Being not completely sure about freeing large chunks of memory successfully sucks, oh well. Also need to find ways of finding better lower bounds on my graph coloring algorithms, the current one gives a maximal lower bound of something like number of colors + 2, and hence without the greedy adjustment to the upper bound, [...]
Read more...