In this graduate class, UC Davis computer science professor Charles Martel describes advanced methods for the design and analysis of algorithms. He applies these techniques to design fast solutions for a wide range of applications including scheduling, network routing, computational biology, resource management and network design. The techniques studied include dynamic programming, network flows and randomized algorithms. The class also studies how to classify problems as hard via np-completeness theory and how to deal with hard problems using approximation algorithms, special cases, and search techniques.
- Home
- Top Charts
- Top Networks
- Top Apps
- Top Independents
- Top Podfluencers
- Top Picks
- Top Business Podcasts
- Top True Crime Podcasts
- Top Finance Podcasts
- Top Comedy Podcasts
- Top Music Podcasts
- Top Womens Podcasts
- Top Kids Podcasts
- Top Sports Podcasts
- Top News Podcasts
- Top Tech Podcasts
- Top Crypto Podcasts
- Top Entrepreneurial Podcasts
- Top Fantasy Sports Podcasts
- Top Political Podcasts
- Top Science Podcasts
- Top Self Help Podcasts
- Top Sports Betting Podcasts
- Top Stocks Podcasts
- Podcast News
- About Us
- Podcast Advertising
- Contact