Continue reading 13.11.2013. 16:38
The code is embedded in a MATLAB Guide and is triggered on a slide event of slider2.
It will result in pictures like this:
Continue reading 13.11.2013. 14:55
http://stackoverflow.com/questions/11498035/c-implementation-of-knapsack-branch-and-bound and in Java
Continue reading 13.11.2013. 13:58Pascal van Hentenryck Optimization class on Coursera I realised (with others) that Simulated Annealing is quite a powerful tool for complex optimisation problems.
What you have to understand is that it is simply a hill climbing algorithm that let's the odd bad (or worse) value through based on some probability. This can be mathematically beautiful or you own concoction. Well I somehow managed to get distinction, even with not having a maths degree.
You could implement the SA like approach like this. Assuming you have some optimisation problem, where you calculate your cost of a certain approach with price. You store your best price (and the settings for it)in a variable called bestprice and some array.
Continue reading 13.11.2013. 12:19
Here for example for Microsoft.You will need some Unix and bash script and python experience. The data is very complicated to be pulled. There are various symbols like the & (&) and footnote numbers. It also changes with changing stock prices. But it can give you a nice market oversight. They most important thing, I guess I noticed is how HUGE Amazon is as a business. 159 BILLION dollars market capitalisation.
The following is a correlation Matrix of Key Statistics of the S&P 500 companies.
Continue reading 13.11.2013. 11:13
Continue reading 13.11.2013. 11:03
Continue reading 07.11.2013. 04:45