Meeting Agenda| Date: | January 10, 2013 |
|---|---|
| Location: | DC 1331 |
| Time: | 11:30 |
| Chair: | ![]() Lesley Northam |
| Date: | January 17, 2013 | January 24, 2013 | January 31, 2013 | February 7, 2013 |
|---|---|---|---|---|
| Location: | DC 1331 11:30 | DC 1331 11:30 | DC 1331 11:30 | DC 1331 11:30 |
| Chair: | ![]() Tyler Nowicki |
![]() Simon Parent |
![]() Alex Pytel |
Matthew Thorne |
| Technical Presentation: | ![]() Lesley Northam |
![]() Tyler Nowicki |
![]() Marta Kryven |
![]() Simon Parent |
![]() Stephen Mann |
Title : Craig's Skyscraper Problem
Abstract: In this talk, I'll describe my solution to Craig's skyscraper problem. The problem is based on the visibility number of a sequence of numbers, where an element in the sequence is said to be visible if it is greater than all numbers that precede it in the sequence. The visibility number of a sequence is the number of elements that are visible. The algorithms I devised find the maximum and minimum visibility numbers of a permutation of N integers, where some of the elements are fixed and the rest may be arranged in any order. |
|---|
Also see other Math and CS postings.