continent:"North America" tags:"electrical engineering and computer science"
Categories
1 results found in 18 ms.

Page 1 of 1

| Pages: 7
This OER is part of OCW: Randomized Algorithms
Published under: /Assignments
Share in: Share this resource in Facebook Share this resource in Twitter Share this resource in LinkedInd Share this resource in Google+ Share this resource in Pinterest Share this resource in Blogger Share this resource in Tumblr

The file is compressed
OCW Authors:
Inherited Tag(s):
Similar courses
  • Description:This course examines how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Topics covered include: randomized computation; data structures (hash tables, skip lists); graph algorithms (minimum spanning trees, shortest paths, minimu
  • Description:This course examines how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Topics covered include: randomized computation; data structures (hash tables, skip lists); graph algorithms (minimum spanning trees, shortest paths, minimu
  • Description:This course examines how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Topics covered include: randomized computation; data structures (hash tables, skip lists); graph algorithms (minimum spanning trees, shortest paths, minimu


1 results found.

Page 1 of 1