Algorithmatica

Exploring the science and art of problem solving

Main menu

Skip to primary content
Skip to secondary content
  • Home
  • Programming Best Practices

Tag Archives: Emi

Markov Chains

Posted on May 14, 2012 by azimmerman
Reply

A markov chain is built by tracking the order data occurs in.  We can then take this observation and create new data that will closely resemble the initially observed data.  With enough data to analyze, this allows the creation of … Continue reading →

  • Share this:
  • Facebook
  • Email
Posted in Algorithms, Non-Technical, Probability | Tagged Composition Algorithm, Emi, Markov, Markov Chain, Markov Process | Leave a reply

Rss

  • RSS - Posts

Recent Posts

  • Getting data out of Facebook – FQL
  • Fundamentally Incomplete
  • Get all Full Text Search word breakers
  • Find area of a polygon
  • Intelligence part 1 – A definition

Archives

  • July 2012
  • June 2012
  • May 2012
  • April 2012

Categories

  • Algorithms
  • Code Jam
  • Efficiency
  • HowTo
  • Math
  • Non-Technical
  • Probability
  • Programming Basics
  • SQL
  • Technical
  • Uncategorized

Tags

Beauty Big O Casino Combinatorial Composition Algorithm Database Divide and Conquer DMV Dynamic Programming Efficiency Emi Expected Value Gambling Golden Ratio Google Code Jam Indexes Index Optimization Index Statistics Index Usage Java Joseph Jagger LCM Least Common Multiple Lottery Markov Markov Chain Markov Process Math Memorization Non-Technical Number Game Optimization Picking Up Chicks Pot Odds Prime Factorization Probability Query Quick Sort Recursion Roulette Sorting Sorting Algorithms Sql Script Sql Server TSQL
Proudly powered by WordPress
loading Cancel
Post was not sent - check your email addresses!
Email check failed, please try again
Sorry, your blog cannot share posts by email.