Computing network node adjustments
US10394767B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 14, 2013 |
| Grant date | Aug 27, 2019 |
| Priority date | — |
| Expiry date | Sep 14, 2036 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/211
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.