This is a preview. Log in through your library . Abstract In this paper, a branch and bound algorithm is presented for solving network design problems (NDP). Route selection for the NDP is based on a ...

This course is compulsory on the BSc in Data Science and BSc in Mathematics with Data Science. This course is available on the BSc in Mathematics and Economics, BSc in Mathematics with Economics, BSc ...

Seeking to reduce the computing power needed for the widely used dynamic mode decomposition algorithm, a team of researchers in China led by Guo-Ping Guo developed a quantum-classical hybrid algorithm ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

The IAEA organizes International Collaborative Standard Problems (ICSPs) to facilitate the development and validation of computer codes for design and safety analysis of nuclear power plants. The ...