List of Interesting ideas and Views:
- Who are the winners of last 24 months for investors? Nvidia, Bitcoin, Gold, US30…
- Joule Analytical Insights & “Just Ask” Best Practices
- Michael Saylor’s Prophecy About Crypto Currency
- SAP Rise & Grow and AI Platform Technologies – Some ideas
- Statistical Consequences of Fat Tails: Real World Preasymptotics
- Should you keep the first Envelope or change? Choice between “Two Envelopes Paradox”
- Tesla SpaceX and Some notes on Future
- Kelly Criteria – Proof using Calculus Knowledge
- Next Generation of Financial Markets for Traders–A Must Read List
- Edward Thorp who beat the dealer, and later, beat the market
- Prediction Markets–If it is not trading what is it?
- Why does XM (Exprience Management) matter?
- 2019 Sıcak Konuları @CEO Gündemi
- Living Longer – Learning from an Ultimate Question of Life
- Can Algorithyms Paint?
Why Industry 4.0 Matters?
Why Industry revolution 4.0 matters?
Deep Learning : Where are we headed?
I was amazed to see that NVIDIA was just talking about deep learning. I am not here to talk about the differences between Artificial Intelligence or Neural Networks or deep learning, but look a the photo below. NVIDIA CEO on stage and painting his vision for next few years for nvidia. 1- A new GPU and deep learning 2- A very fast box and deep learning 3- Roadmap reveal and deep learning 4- Self-Driving cars...
Guney Digital Art – TSP Path Algorithm
The Original Photo of Guney Candan Back ground removed Thanks to http://www.evilmadscientist.com/ below is the Voronoi Diagram calculated by StippleGen_2 Then after 20 iterations with 3000 dots ductBelow is the TSP path calculated The final V plated end product ! One hand drawing added. This time no software generated view I tried to converting to SVG file Related posts: Art: Pencil Drawn Bora Ugur and Guney Traveling Salesman Problem and Digital Art Coca-Cola Adjust Taste...
Traveling Salesman Problem and Digital Art
Traveling salesman problem: Wikipedia: “The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.” In the mathematics literature, it appears that the first mention of the TSP was...