Sunday, July 03, 2016

Microsoft Technology Centers

Microsoft Technology Centers

"At the MTC, we will help you find the right solutions to transform your business in a mobile-first, cloud-first world.
With over 30 locations around the globe, the MTCs bring together the right resources to help you explore the potential impact of cloud, mobile & social solutions to your business."

Microsoft Technology Center - Philadelphia

philly.NET – Philadelphia Area .NET User Group

book: Algorithms to Live By

Algorithms to Live By Front Cover
presentation: Brian Christian: Algorithms to Live By - The Long Now

"Deciding when to stop your quest for the ideal apartment, or ideal spouse, depends entirely on how long you expect to be looking, says Brian Christian. The first one you check will be the best you’ve seen, but it’s unlikely to be the best you’ll ever see. So you keep looking and keep finding new bests, though ever less frequently, and you start to wonder if maybe you refused the very best you’ll ever find. And the search is wearing you down. When should you take the leap and look no further?

The answer from computer science is precise: 37% of the way through your search period. If you’re spending a month looking for an apartment, you should calibrate (and be sorely tempted) for 11 days, and then you should grab the next best-of-all you find."

book's website: Algorithms to Live By | Brian Christian | Macmillan

author's website: Algorithms to Live By | Brian Christian

Brian Christian - Wikipedia, the free encyclopedia

Algorithms to Live By: The Computer Science of Human Decisions: Brian Christian, Tom Griffiths: 0889290409195: Books

review: Algorithms to Live By @ huffingtonpost

Dynamic programming - Wikipedia, the free encyclopedia
"dynamic programming (also known as dynamic optimization) is a method for solving a complex problem by breaking it down into a collection of simpler subproblems, solving each of those subproblems just once, and storing their solutions... A dynamic programming algorithm will examine the previously solved subproblems and will combine their solutions to give the best solution for the given problem"

Optimal stopping - Wikipedia, the free encyclopedia

Secretary problem - Wikipedia, the free encyclopedia