Random choice


By Erlang Central | Published: June 22, 2012



In this talk Bob will discuss different techniques and data structures for weighted random choice in Erlang. Random choice is an essential part of many systems, especially distributed systems, such as ad servers. The concepts in this this talk will be demonstrated with a “learning” IRC bot that builds a Markov chain and uses it to make sentences.
Talk Objectives:
– show how functional data structures can be developed;
– discuss trade-offs that can be made to suit different use cases;
Target Audience:
– Developers interested in random processes, functional data structures, and/or algorithms for Erlang.
Slides are available here.

Speakers:

  • Bob Ippolito

    Currently on vacation

    Bob Ippolito was the CTO and cofounder of Mochi Media, and creator of Mochi Web. Bob started using Erlang in 2006 to prototype an ad server, and it quickly became the de facto platform for building servers at Mochi. Bob's open source contributions to the Erlang community include mochiweb, statebox, egeoip and kvc.

    Bob Ippolito


Follow Erlang Central:


Have an Erlang Question?

Reach out to the Erlang community





Tags