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 6 other people reading this forum.


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

Login to reply
11:05pm Tue 23rd Aug, Tiziano W.

Hello, My partner and I were reading through the project brief, and we were just wondering if you would be able to clarify the first step of the initialization inputs. It states that the input will give n and p, the number of green agents and the probability of connections. We assumed these n, p values are denoting a binomial distribution, but we are unsure how we would setup the network using these. The brief states that every node has to have a probability of interaction with another node, but if we were to use the n p values as a binomial distribution, we would only be able to create a graph showing nodes as either connected or not connected, as a binomial distribution is boolean. We were wondering if you would be able to clarify how one would use the inputs to create a "weighted" network graph rather than simply a graph showing absolute connections between nodes. Thank you in advance for your time.

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