-
Notifications
You must be signed in to change notification settings - Fork 5
Project Resources & Specifications
Relevant files regarding to SE306 Project 1 can be found on this Canvas page.
-
Download key files:
-
SE306 Lecture notes (for reference):
These resources were researched and found by members of MV-HARD. Members are encouraged to read and use these as references to guide the project, as long as any learnings is explicitly referenced to the relevant papers in code and in the modules of the wiki (to be able to accurately reference these resources in the report).
- Reducing Solution Space (A*, Pruning, Cost Functions)
-
Sinnen, O. (2013). Reducing the solution space of optimal task scheduling. Computers & Operations Research. doi: 10.1016/j.cor.2013.09.004
-
- Scheduling Task Graphs Optimally with A*
-
Semar Shahul, A. Z., & Sinnen, O. (2010). Scheduling task graphs optimally with A*. The Journal of Supercomputing, 51(3), 310–332. doi: 10.1007/s11227-010-0395-1
-
- Geeks for Geeks: A*
- Computerphile: A* Algorithm Video
-
Efficient Branch and Bound Search with Application to Computer-Aided Design
-
Chen, X., & Bushnell, M. L. (1996). Efficient Branch and Bound Search with Application to Computer-Aided Design. Frontiers in Electronic Testing. doi: 10.1007/978-1-4613-1329-8
-
- ScienceDirect: Branch and Bound Article
- Home
- Team Details
- Meeting Minutes
- Project Resources & Specifications
- Conventions
- Basic Implementation
- Optimal Implementation
- Algorithm Optimisations