Simple conclusions from P!=NP battle

All this battle around P!=NP paper can give to an ordinal student a very important hint.

It is nearly clear that there will be a huge demand for algorithms considering NP problems and inventing algorithms that can solve it faster - obviously not as fast as a P problem ... but each, even simple improvement can lead to a huge improvement (in total) on such complex tasks. Besides we still will have to consider
1. Heuristic approaches as those will still be demanded
2. Finding and isolating classes or subclasses of tasks (problems, graphs) which can be solved in P

A post on the scheduling problem

Here is an extremely motivating post about the scheduling problem for beginners with a background in math. Clearly stated easiness for small and ordinal problem and complexity for large scale problems or those, which have different kinds of restrictions. Actually it also refers to this paper, which should be the next step getting into the scheduling problem.

Personally I think it is quite an opportunity for writing a master work for those who hasn't decided yet on a title of their thesis. A lot of work-places has such problems (hospitals, educational centers etc) so it can be treated within the organisation specific restrictions set and so be analytic as well.

End of story II

In continue the previous story. The worst thing about that fact is that you cannot really rely on Google since the technology their are offering on the market can be closed at any moment. They are so new, so modern and so risky to follow.

Here is a short story of such fact a Google graveyard.

End of story

A quickly ended history of one well-known and widely marketed technology - Google wave.

Another interesting topic for a master work

Here is another, interesting, unusual and for some people risk-free theme for a master work in SE.

One more interesting article on the same topic

Clouds performs in ... (what? number of rains, size?)

"Measuring and Comparing the Performance of 5 Cloud Platforms"

Interesting that Salesforce performs quite nicely.

Distinguished lectures

I join to fans of this lecture :) RailsConf 09: Robert Martin, "What Killed Smalltalk Could Kill Ruby, Too"

that is how it should be done



WTF per minute metric :) superb