Algorithms for Temporal Networks
Luke Hunsberger (Computer Science)
A temporal network is a data structure for representing and reasoning about time, especially constraints on activities. Different kinds of temporal networks have different kinds of features (e.g., some can accommodate actions with uncertain durations, while others can accommodate actions that generate information in real time). This project will involve implementing algorithms from the literature on Temporal Networks with the aim of empirically evaluating them in reproducible ways.
Students should have taken CMPU-101, CMPU-102 and CMPU-145. CMPU-203 and CMPU-241 are recommended.
How should students express interest in this project?
Interested students should contact me by email (firstname.lastname@example.org) to set up an appointment to discuss the project. Please include a summary of your prior programming experience in Computer Science.