This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...
Tech Xplore on MSN
Shortest paths research narrows a 25-year gap in graph algorithms
Most of you have used a navigation app like Google Maps for your travels at some point. These apps rely on algorithms that compute shortest paths through vast networks. Now imagine scaling that task ...
A new multi-granularity fuzzy rough feature selection method fuses algebraic and informational views, improving classification accuracy across 20 benchmark datasets.
*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.
A new nested multi-time-scale stochastic approximation method eliminates ratio-induced bias in likelihood-free parameter ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results