February 16, 2007

Bulk view

The bin-packing problem

Every computer scientist learns, at some point, algorithms for solving the bin-packing problem. That is: given a container of limited size and objects of varying size and value, find the combination of items that results in maximum value. As the exhaustive way of solving this problem is, of course, exhausting, I choose the greedy heuristic: take the items that mean the most to me and put them in.

So I take with me only the things with memories attached to them, because those are the only things worth keeping anyway...

Random Emacs symbol: calendar-make-alist - Function: Make an assoc list corresponding to SEQUENCE.

Matter resolved

After an intense week of conversation, the matter that had been on my mind has been resolved. I think that things turned out in the best way possible. Unbloggable details to be shared over hot chocolate or cellphone; summary of decision to be posted on blog when finalized.

...

Random Emacs symbol: pcomplete-quote-arg-hook - Variable: *A hook which is run to quote a character within a filename.