[MINI] Ant Colony Optimization
Data Skeptic8 Aug 2014

[MINI] Ant Colony Optimization

In this week's mini episode, Linhda and Kyle discuss Ant Colony Optimization - a numerical / stochastic optimization technique which models its search after the process ants employ in using random walks to find a goal (food) and then leaving a pheremone trail in their walk back to the nest. We even find some way of relating the city of San Francisco and running a restaurant into the discussion.

Det här avsnittet är hämtat från ett öppet RSS-flöde och publiceras inte av Podme. Det kan innehålla reklam.

Avsnitt(601)

Fault Tolerant Distributed Gradient Descent

Fault Tolerant Distributed Gradient Descent

Nirupam Gupta, a Computer Science Post Doctoral Researcher at EDFL University in Switzerland, joins us today to discuss his work "Byzantine Fault-Tolerance in Peer-to-Peer Distributed Gradient-Descent...

22 Feb 202136min

Decentralized Information Gathering

Decentralized Information Gathering

Mikko Lauri, Post Doctoral researcher at the University of Hamburg, Germany, comes on the show today to discuss the work Information Gathering in Decentralized POMDPs by Policy Graph Improvements. Fol...

15 Feb 202132min

Leaderless Consensus

Leaderless Consensus

Balaji Arun, a PhD Student in the Systems of Software Research Group at Virginia Tech, joins us today to discuss his research of distributed systems through the paper "Taming the Contention in Consens...

5 Feb 202127min

Automatic Summarization

Automatic Summarization

Maartje ter Hoeve, PhD Student at the University of Amsterdam, joins us today to discuss her research in automated summarization through the paper "What Makes a Good Summary? Reconsidering the Focus o...

29 Jan 202127min

Gerrymandering

Gerrymandering

Brian Brubach, Assistant Professor in the Computer Science Department at Wellesley College, joins us today to discuss his work "Meddling Metrics: the Effects of Measuring and Constraining Partisan Ger...

22 Jan 202134min

Even Cooperative Chess is Hard

Even Cooperative Chess is Hard

Aside from victory questions like "can black force a checkmate on white in 5 moves?" many novel questions can be asked about a game of chess. Some questions are trivial (e.g. "How many pieces does whi...

15 Jan 202123min

Consecutive Votes in Paxos

Consecutive Votes in Paxos

Eil Goldweber, a graduate student at the University of Michigan, comes on today to share his work in applying formal verification to systems and a modification to the Paxos protocol discussed in the p...

11 Jan 202130min

Visual Illusions Deceiving Neural Networks

Visual Illusions Deceiving Neural Networks

Today on the show we have Adrian Martin, a Post-doctoral researcher from the University of Pompeu Fabra in Barcelona, Spain. He comes on the show today to discuss his research from the paper "Convolut...

1 Jan 202133min

Populärt inom Vetenskap

allt-du-velat-veta
p3-dystopia
dumma-manniskor
rss-ufobortom-rimligt-tvivel
ufo-sverige
kapitalet-en-podd-om-ekonomi
svd-nyhetsartiklar
hacka-livet
sexet
paranormalt-med-caroline-giertz
rss-vetenskapsradion
det-morka-psyket
rss-vetenskapsradion-2
ufo-sverige-2
rss-spraket
medicinvetarna
dumforklarat
halsorevolutionen
rss-dennis-world
rss-klotet