a rupestrian algorithm
play

A Rupestrian Algorithm FUN 2016 Giuseppe A. Di Luna, Paola - PowerPoint PPT Presentation

May 12, 2023 •352 likes •1.86k views

A Rupestrian Algorithm FUN 2016 Giuseppe A. Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta La Maddalena June 8, 2016 A Rupestrian Algorithm A recent archaeological expedition discovered ancient cave

  1. Ritual: creating Chiefs If an Explorer sees a Marker with no scepter, it becomes a Disciple and stops moving./ A Rupestrian Algorithm

  2. Ritual: creating Chiefs If an Explorer sees a Marker with no scepter, it becomes a Disciple and stops moving./ A Rupestrian Algorithm

  3. Ritual: creating Chiefs If an Explorer and a Chief bump into each other, they swap their states (equivalently, they switch positions)./ A Rupestrian Algorithm

  4. Ritual: creating Chiefs If an Explorer and a Chief bump into each other, they swap their states (equivalently, they switch positions)./ A Rupestrian Algorithm

  5. Ritual: creating Chiefs If an Explorer sees a Disciple, it becomes a Disciple, as well. / A Rupestrian Algorithm

  6. Ritual: creating Chiefs If an Explorer sees a Disciple, it becomes a Disciple, as well. / A Rupestrian Algorithm

  7. Ritual: Unique Leader case If a Chief reaches a Marker who still has the scepter, he acquires the scepter and becomes Unique Leader./ A Rupestrian Algorithm

  8. Ritual: Unique Leader case If a Chief reaches a Marker who still has the scepter, he acquires the scepter and becomes Unique Leader./ A Rupestrian Algorithm

  9. Ritual: Unique Leader case If a Chief reaches a Marker who still has the scepter, he acquires the scepter and becomes Unique Leader./ A Rupestrian Algorithm

  10. Ritual: Unique Leader case If a Chief reaches a Marker who still has the scepter, he acquires the scepter and becomes Unique Leader./ A Rupestrian Algorithm

  11. Ritual: Unique Leader case The Unique Leader goes around the initial line, and all who see him become Followers./ A Rupestrian Algorithm

  12. Ritual: Unique Leader case The Unique Leader goes around the initial line, and all who see him become Followers./ A Rupestrian Algorithm

  13. Ritual: Unique Leader case The Unique Leader goes around the initial line, and all who see him become Followers./ A Rupestrian Algorithm

  14. Ritual: Unique Leader case The Unique Leader goes around the initial line, and all who see him become Followers./ A Rupestrian Algorithm

  15. Ritual: Unique Leader case If two villagers try to move to the same spot, only one succeeds (chosen at random)./ A Rupestrian Algorithm

  16. Ritual: Unique Leader case If two villagers try to move to the same spot, only one succeeds (chosen at random)./ A Rupestrian Algorithm

  17. Ritual: Unique Leader case If two villagers try to move to the same spot, only one succeeds (chosen at random)./ A Rupestrian Algorithm

  18. Ritual: Unique Leader case If two villagers try to move to the same spot, only one succeeds (chosen at random)./ A Rupestrian Algorithm

  19. Ritual: Unique Leader case If two villagers try to move to the same spot, only one succeeds (chosen at random)./ A Rupestrian Algorithm

  20. Ritual: Unique Leader case Each member of the queue waits for the next member to reach him, and then takes another step./ A Rupestrian Algorithm

  21. Ritual: Unique Leader case Each member of the queue waits for the next member to reach him, and then takes another step./ A Rupestrian Algorithm

  22. Ritual: Unique Leader case Each member of the queue waits for the next member to reach him, and then takes another step./ A Rupestrian Algorithm

  23. Ritual: Unique Leader case Each member of the queue waits for the next member to reach him, and then takes another step./ A Rupestrian Algorithm

  24. Ritual: Unique Leader case Eventually, all the active villagers become part of the line and can start the migration./ A Rupestrian Algorithm

  25. Ritual: Opposing Leaders case If the Markers give their scepters to two different Explorers, two Chiefs are created./ A Rupestrian Algorithm

  26. Ritual: Opposing Leaders case If two Chiefs meet, they become Opposing Leaders and switch directions./ A Rupestrian Algorithm

  27. Ritual: Opposing Leaders case If two Chiefs meet, they become Opposing Leaders and switch directions./ A Rupestrian Algorithm

  28. Ritual: Opposing Leaders case The Opposing Leaders walk around the initial line collecting everyone, until they meet again on the other side./ A Rupestrian Algorithm

  29. Ritual: Opposing Leaders case Now their goal is to determine a winner by comparing the sizes of their respective queues./ A Rupestrian Algorithm

  30. Ritual: Opposing Leaders case To this end, they send a message to their respective Follower, which is forwarded all the way to the tail./ A Rupestrian Algorithm

  31. Ritual: Opposing Leaders case To this end, they send a message to their respective Follower, which is forwarded all the way to the tail./ A Rupestrian Algorithm

  32. Ritual: Opposing Leaders case Then the message bounces back and goes to the head again. / A Rupestrian Algorithm

  33. Ritual: Opposing Leaders case Then the message bounces back and goes to the head again. / A Rupestrian Algorithm

  34. Ritual: Opposing Leaders case The first Opposing Leader to get the message back is the loser, and becomes a Follower./ A Rupestrian Algorithm

  35. Ritual: Opposing Leaders case The other Opposing Leader becomes then the Unique Leader, and guides the procession./ A Rupestrian Algorithm

  36. Ritual: Opposing Leaders case The other Opposing Leader becomes then the Unique Leader, and guides the procession./ A Rupestrian Algorithm

  37. Ritual: Opposing Leaders case The other Opposing Leader becomes then the Unique Leader, and guides the procession./ A Rupestrian Algorithm

  38. Ritual: Opposing Leaders case The other Opposing Leader becomes then the Unique Leader, and guides the procession./ A Rupestrian Algorithm

  39. Ritual: Opposing Leaders case The other Opposing Leader becomes then the Unique Leader, and guides the procession./ A Rupestrian Algorithm

  40. Ritual: Opposing Leaders case The other Opposing Leader becomes then the Unique Leader, and guides the procession./ A Rupestrian Algorithm

  41. Ritual: Opposing Leaders case The other Opposing Leader becomes then the Unique Leader, and guides the procession./ A Rupestrian Algorithm

  42. Ritual: Opposing Leaders case The other Opposing Leader becomes then the Unique Leader, and guides the procession./ A Rupestrian Algorithm

  43. Ritual: Opposing Leaders case However, if one of the two queues bends, its head is automatically declared the winner, even if that queue is shorter./ A Rupestrian Algorithm

Recommend

The Definition of Algorithm The Definition of Algorithm p.1/31

The Definition of Algorithm The Definition of Algorithm p.1/31

The Definition of Algorithm The Definition of Algorithm p.1/31 An informal discussion Informally speaking, an algorithm is a collection of simple instructions for carrying out a task Note: in

1.26k views • 31 slides
Algorithm Analysis CS 201 Introduction Once a correct algorithm is designed for a given

Algorithm Analysis CS 201 Introduction Once a correct algorithm is designed for a given

Algorithm Analysis CS 201 Introduction Once a correct algorithm is designed for a given problem, an important step is to determine how much in the way of resources (such as time and space) the algorithm will require You will learn how to

378 views • 20 slides
A-Star Algorithm & Heaps/Priority Queues Mark Redekopp 2 A* Search Algorithm ALGORITHM

A-Star Algorithm & Heaps/Priority Queues Mark Redekopp 2 A* Search Algorithm ALGORITHM

1 EE 355 Unit 14 A-Star Algorithm & Heaps/Priority Queues Mark Redekopp 2 A* Search Algorithm ALGORITHM HIGHLIGHT 3 Search Methods Many systems require searching for goal states Path Planning Roomba Vacuum

887 views • 40 slides
Avoiding Register Overflow in the Bakery Algorithm The Bakery++ Algorithm The Bakery algorithm is

Avoiding Register Overflow in the Bakery Algorithm The Bakery++ Algorithm The Bakery algorithm is

Avoiding Register Overflow in the Bakery Algorithm The Bakery++ Algorithm The Bakery algorithm is the first true solution of mutual exclusion, but it suffers from register overflows. Bakery++ is a slightly modified version of Bakery that avoids

425 views • 6 slides
Odds Algorithm An Online Algorithm Group Fibonado 20. Dec 2016 Group Fibonado Odds Algorithm

Odds Algorithm An Online Algorithm Group Fibonado 20. Dec 2016 Group Fibonado Odds Algorithm

Odds Algorithm An Online Algorithm Group Fibonado 20. Dec 2016 Group Fibonado Odds Algorithm 20. Dec 2016 1 / 21 Outline Introduction 1 Online Algorithm The Secretary Problem Optimal Stopping 2 Odds Algorithm 3 Algorithm Proof

1.27k views • 55 slides
Quiz I Give the SVD-based algorithm for solving least squares, and I justify the algorithm by that

Quiz I Give the SVD-based algorithm for solving least squares, and I justify the algorithm by that

Quiz I Give the SVD-based algorithm for solving least squares, and I justify the algorithm by that showing it outputs the correct answer. I Under what circumstances would this algorithm be preferred over the QR-based algorithm? The Eigenvector

905 views • 18 slides
What is an Algorithm? Quite generally, an algorithm is a set of instructions that lead to

What is an Algorithm? Quite generally, an algorithm is a set of instructions that lead to

What is an Algorithm? Quite generally, an algorithm is a set of instructions that lead to some desired Fundamentals: All About result Algorithms Must first decompose a problem, and then express its method of solution as a Computer

407 views • 7 slides
Algorithm Analysis October 12, 2016 CMPE 250 Algorithm Analysis October 12, 2016 1 / 66

Algorithm Analysis October 12, 2016 CMPE 250 Algorithm Analysis October 12, 2016 1 / 66

Algorithm Analysis October 12, 2016 CMPE 250 Algorithm Analysis October 12, 2016 1 / 66 Problem Solving: Main Steps Problem definition 1 Algorithm design / Algorithm specification 2 Algorithm analysis 3 Implementation 4 Testing 5

943 views • 66 slides
Algorithms and Algorithm Analysis Etymology of Algorithm Algorism = process of doing

Algorithms and Algorithm Analysis Etymology of Algorithm Algorism = process of doing

CS206 CS206 Algorithms and Algorithm Analysis Etymology of Algorithm Algorism = process of doing arithmetic using Arabic numerals. Algorithm: A clearly specified set of instructions the computer A misperception: algiros [painful] +

316 views • 4 slides
Why the Junction Tree Algorithm? The Junction Tree Algorithm The JTA is a general-purpose

Why the Junction Tree Algorithm? The Junction Tree Algorithm The JTA is a general-purpose

Why the Junction Tree Algorithm? The Junction Tree Algorithm The JTA is a general-purpose algorithm for computing (conditional) marginals on graphs. It does this by creating a tree of cliques, and carrying out a Chris Williams 1 message-passing

186 views • 7 slides
The EM Algorithm The EM algorithm Mixture models Why EM works EM variants Learning

The EM Algorithm The EM algorithm Mixture models Why EM works EM variants Learning

Preview The EM Algorithm The EM algorithm Mixture models Why EM works EM variants Learning with Missing Data The EM Algorithm Goal: Learn parameters of Bayes net with known structure Initialize parameters ignoring missing

363 views • 3 slides
Lecture 1 Grade school algorithms Sept. 8, 2017 1 What is an algorithm? An algorithm is a

Lecture 1 Grade school algorithms Sept. 8, 2017 1 What is an algorithm? An algorithm is a

Lecture 1 Grade school algorithms Sept. 8, 2017 1 What is an algorithm? An algorithm is a sequence of instructions or rules or operations for manipulating data to produce some result. Think of an algorithm as a recipe. In CS, the recipe

942 views • 32 slides
Dijkstras Algorithm Problem Solving Club February 1, 2017 Dijkstras algorithm

Dijkstras Algorithm Problem Solving Club February 1, 2017 Dijkstras algorithm

Dijkstras Algorithm Problem Solving Club February 1, 2017 Dijkstras algorithm Dijkstras is a greedy algorithm that finds shortest paths from a single source to every other vertex in the graph. As usually implemented: Works

360 views • 22 slides
23. Shortest Paths Motivation, Dijkstras algorithm on distance graphs, Bellman-Ford Algorithm,

23. Shortest Paths Motivation, Dijkstras algorithm on distance graphs, Bellman-Ford Algorithm,

23. Shortest Paths Motivation, Dijkstras algorithm on distance graphs, Bellman-Ford Algorithm, Floyd-Warshall Algorithm [Ottman/Widmayer, Kap. 9.5 Cormen et al, Kap. 24.1-24.3, 25.2-25.3] 644 River Crossing (Missionaries and Cannibals)

533 views • 38 slides
ECE 242 Data Structures Lecture 2 Algorithm Analysis September 11, 2009 ECE242 L2: Algorithm

ECE 242 Data Structures Lecture 2 Algorithm Analysis September 11, 2009 ECE242 L2: Algorithm

ECE 242 Data Structures Lecture 2 Algorithm Analysis September 11, 2009 ECE242 L2: Algorithm Analysis Overview Problem: How can we quantify if one algorithm is better than another? Primarily concerned about growth of runtime as input

358 views • 15 slides
Algorithms http://cs.mst.edu What is an algorithm? An algorithm is a clear, concise, and

Algorithms http://cs.mst.edu What is an algorithm? An algorithm is a clear, concise, and

Algorithms http://cs.mst.edu What is an algorithm? An algorithm is a clear, concise, and correct step- by-step sequence of actions used to solve a problem or set of problems http://cs.mst.edu Example 1 Problem Write an algorithm that

309 views • 9 slides
Roadmap Frequent Patterns A-Priori Algorithm Improvements to A-Priori Park-Chen-Yu

Roadmap Frequent Patterns A-Priori Algorithm Improvements to A-Priori Park-Chen-Yu

Roadmap Frequent Patterns A-Priori Algorithm Improvements to A-Priori Park-Chen-Yu Algorithm Multistage Algorithm Approximate Algorithms Compacting Results 50 Data Mining for Knowledge Management PCY Algorithm

859 views • 20 slides
Stoer-Wagner Algorithm A Minimum Cut Algorithm for Undirected Graphs BigNews CS214: Algorithms

Stoer-Wagner Algorithm A Minimum Cut Algorithm for Undirected Graphs BigNews CS214: Algorithms

The Algorithm Correctness Running Time Stoer-Wagner Algorithm A Minimum Cut Algorithm for Undirected Graphs BigNews CS214: Algorithms and Complexity Shanghai Jiao Tong University 2016.12.06 The Algorithm Correctness Running Time Outline

760 views • 51 slides
algorithm of Savage and JaJa [SJ81] uses O(log n) (resp. O((log - Implementation 2 is faster

algorithm of Savage and JaJa [SJ81] uses O(log n) (resp. O((log - Implementation 2 is faster

SIAM J. COMPUT. 1985 Society for Industrial and Applied Mathematics Vol. 14, No. 4, November 1985 007 AN EFFICIENT PARALLEL BICONNECTIVITY ALGORITHM* ROBERT E. TARJAN AND UZI VISHKIN:I: Abstract. In this paper we propose a new algorithm for

701 views • 13 slides
Chart Parsing: The Earley Algorithm 2 The Earley Algorithm Informatics 2A: Lecture 18 Parsing

Chart Parsing: The Earley Algorithm 2 The Earley Algorithm Informatics 2A: Lecture 18 Parsing

1 Adding Prediction to the Chart Prediction Dotted Rules Chart Parsing: The Earley Algorithm 2 The Earley Algorithm Informatics 2A: Lecture 18 Parsing Operations Details of the Algorithm Bonnie Webber (revised by Frank Keller) Visualizing

649 views • 6 slides
Fiduccia-Mattheyses Algorithm Perform FM algorithm on the following circuit: Area

Fiduccia-Mattheyses Algorithm Perform FM algorithm on the following circuit: Area

Fiduccia-Mattheyses Algorithm Perform FM algorithm on the following circuit: Area constraint = [3,5] Break ties in alphabetical order. Practical Problems in VLSI Physical Design FM Partitioning (1/12) Initial Partitioning Random

582 views • 12 slides
Another Dynamic Algorithm: Scoreboard Summary Tomasulo Algorithm Speedup 1.7 from compiler;

Another Dynamic Algorithm: Scoreboard Summary Tomasulo Algorithm Speedup 1.7 from compiler;

Another Dynamic Algorithm: Scoreboard Summary Tomasulo Algorithm Speedup 1.7 from compiler; 2.5 by hand For IBM 360/91 about 3 years after CDC 6600 BUT slow memory (no cache) limits benefit Goal: High Performance without special

303 views • 3 slides
Lecture 20: Topological Sort Algorithm Algorithm Slide 1 MP1 Decide on footnote

Lecture 20: Topological Sort Algorithm Algorithm Slide 1 MP1 Decide on footnote

Chair of Softw are Engineering Einfhrung in die Programmierung Einfhrung in die Programmierung Introduction to Programming P Prof. Dr. Bertrand Meyer f D B t d M MP1 HS 2007 Lecture 20: Topological Sort Algorithm Algorithm Slide

607 views • 59 slides
Asymptotic Algorithm Analysis We can analyse an algorithm without needing to run it, and thus

Asymptotic Algorithm Analysis We can analyse an algorithm without needing to run it, and thus

Topic 6: Algorithm Analysis & Sorting 1 (Version of November 14, 2011) Pierre Flener Computing Science Division Department of Information Technology Uppsala University Sweden Course 1DL201: Program Construction and Data Structures 1

319 views • 12 slides

More recommend