Computing network node adjustments
AssigneeOracle International Corporation
InventorsAmit BHALLA, Parag AWADHIYA, Arun TIWARI
Life of this patent
Estimating the term…
Loading patent…
AssigneeOracle International Corporation
InventorsAmit BHALLA, Parag AWADHIYA, Arun TIWARI
Estimating the term…
A method of computing relative rankings for multiple course trajectories may include accessing a data structure. The data structure may include a first node that may represent a first course and a plurality of nodes that may represent courses that are available after completing the first course. Each of the plurality of nodes may be associated with a weight, and the plurality of nodes may include a second node representing a second course. The method may also include receiving a first grade for a student for the first course and receiving a second grade for the student for the second course. The method may additionally include adjusting the weight associated with the second node using the first grade and the second grade. The method may further include providing a ranking of the plurality of courses using the weights of the plurality of courses.
A method of computing relative rankings for multiple course trajectories, the method comprising:
A computer-readable memory comprising a sequence of instructions which, when executed by one or more processors, causes the one or more processors to compute relative rankings for multiple course trajectories by:
A system comprising:
Dependencies are inferred from the claim text.