web:start
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
web:start [2007/08/15 23:16] – jas | web:start [2017/12/20 19:06] (current) – jas | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== Web Publishing | + | ====== Web Publishing including |
- | ====== Assignment 1 ====== | + | |
- | + | | |
- | ===== Find a concurrent algorithm ===== | + | * [[.:webprotect:]] |
- | + | ||
- | Find a concurrent algorithm in the literature. The algorithm should not be trivial but also not extremely complex (since you are going to implement and verify the algorithm in Assignment 2 and 3). Concurrent algorithms are applicable to various areas including | + | |
- | + | ||
- | ===== Ask the instructor | + | |
- | + | ||
- | Ask the instructor if the algorithm is appropriate. Email the doi of the paper describing the algorithm to the instructor. | + | |
- | + | ||
- | + | ||
- | + | ||
- | ===== Add your paper to the list ===== | + | |
- | + | ||
- | Once your paper has been approved by the instructor, add your paper to the list below. | + | |
- | + | ||
- | + | ||
- | ===== Write a report ===== | + | |
- | + | ||
- | Write a report. In the report, describe your algorithm using pseudocode. If you have found a description of the algorithm in pseudocode in the literature, you may use that description. However, do not forget to mention the source. Also explain the algorithm in your own words. This implies that you do not copy parts of the paper. Feel free to include examples. If the examples are not your own, then mention the source. | + | |
- | + | ||
- | You are encouraged to use LaTeX and BiBTeX to write your report. You may start from the files [[http:// | + | |
- | + | ||
- | + | ||
- | ===== List of papers ===== | + | |
web/start.1187234213.txt.gz · Last modified: 2007/08/15 23:16 by jas