PLEASE NOTE: this server, secure.csse.uwa.edu.au, will be unavailable on Monday 5th December, from 1pm until 4pm.
Web-based programs, such as csmarks, cssubmit, and the help fora, will all be unavailable.
  It's UWAweek 49

help3001

This forum is provided to promote discussion amongst students enrolled in CITS3001 Algorithms, Agents and Artificial Intelligence.

Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!"  followup message.

How do I ask a good question?
Displaying selected article
Showing 1 of 175 articles.
Currently 4 other people reading this forum.


 UWA week 34 (2nd semester, week 5) ↓
SVG not supported

Login to reply
10:40am Fri 26th Aug, Mehwish N.

That is a very good reply Ryan! Those of you who would like to jump to implementing your agents first and then solving the initialisation stuff, can use the files that I have uploaded on LMS>Project2022 (also available on teams). Erdos-Renyi is indeed the easiest approach to generate graphs. If you want to implement more sophisticated solutions you can use other models (e.g., preferential attachment, planted partition or ERMGs). Please note you will not be penalised for not using a sophisticated network model, however those who implement sophisticated network models may end up in writing better test cases and producing close to real life solutions. A basic G(n,p), where n= number of nodes and p= probability of connections is fine. You may want to explore networkX in python or igraph (if you are working in python). I am only throwing pointers, at the end of the day it is your choice how you implement!

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  1:17AM Sep 14 2022
Privacy policy