Filters
Clear allLocation
Age range
Role
- (-) Remove Trainee Teacher filter Trainee Teacher
- (-) Remove Head Teacher filter Head Teacher
- Teacher (9) Apply Teacher filter
- Head of department/Subject Lead (8) Apply Head of department/Subject Lead filter
- Returning Teacher (7) Apply Returning Teacher filter
- Supply Teacher (5) Apply Supply Teacher filter
- Other (2) Apply Other filter
- Senior Leader (1) Apply Senior Leader filter
Showing 5 results
- (-) Remove Show only CPD activities with scheduled dates. filter Show only CPD activities with scheduled dates.
Pathfinding algorithms are used to find solutions to a given problem, using the shortest path between a set of points. These problems are commonplace, from satellite navigation systems to internet packet routing. During this course you’ll learn how the Dijkstra’s and A* search algorithms function.You...
Start date | 15 Oct 2024 |
---|---|
Location | Remote Delivered CPD |
Duration | 2 Hours |
Fees | Free |
Subsidy | Computing Subsidy up to - £0.00 |
Pathfinding algorithms are used to find solutions to a given problem, using the shortest path between a set of points. These problems are commonplace, from satellite navigation systems to internet packet routing. During this course you’ll learn how the Dijkstra’s and A* search algorithms function.You...
Start date | 22 Oct 2024 |
---|---|
Location | |
Duration | 2 Hours |
Fees | Free |
Subsidy | Computing Subsidy up to - £0.00 |
Trust Science Leads Network meetingSL700LA01
Start date | 08 Nov 2024 |
---|---|
Location | Cambridge |
Duration | 1 Day |
Fees | Free |
Subsidy | From - £0.00 |
Pathfinding algorithms are used to find solutions to a given problem, using the shortest path between a set of points. These problems are commonplace, from satellite navigation systems to internet packet routing. During this course you’ll learn how the Dijkstra’s and A* search algorithms function.You...
Start date | 18 Nov 2024 |
---|---|
Location | |
Duration | 2 Hours |
Fees | Free |
Subsidy | Computing Subsidy up to - £0.00 |
Pathfinding algorithms are used to find solutions to a given problem, using the shortest path between a set of points. These problems are commonplace, from satellite navigation systems to internet packet routing. During this course you’ll learn how the Dijkstra’s and A* search algorithms function.You...
Start date | 02 Dec 2024 |
---|---|
Location | |
Duration | 2 Hours |
Fees | Free |
Subsidy | Computing Subsidy up to - £0.00 |