Once upon a time, I was very interested in computing complexity theory. I wish I could remember, now, the subtleties of the theory. But I remember enough to be interested in the purported proof that P != NP. Very interesting.
{ 0 comments }
Once upon a time, I was very interested in computing complexity theory. I wish I could remember, now, the subtleties of the theory. But I remember enough to be interested in the purported proof that P != NP. Very interesting.
{ 0 comments }
I just finished a conference call with a vendor who built and uses their own “cloud” to host applications for their customers. There were several lessons they learned along the way. Without comment, here are some of the lessons they mentioned: XEN works great for building internal clouds. They tried VMWare, which worked, but [...]
{ 1 comment }