CSE 589 Part VII

11/8/00


Click here to start


Table of Contents

CSE 589 Part VII

PPT Slide

Local Search Algorithms

Local Search Procedure for TSP

Does Greedy Local Search Lead Eventually To Optimal Tour?

Solution Spaces

Other Types of Local Moves For TSP Used

Problem with local search

PPT Slide

Simulated Annealing

Notation

Moves for TSP (example)

Metropolis Algorithm

What’s going on?

Cooling Schedule

Termination Criteria

An algorithms engineering view of Hashing Schemes and Related Topics

Engineering

Engineering

Algorithms Engineering

Plan

Reading

Some other good books...

Dictionaries (Symbol tables)

Some examples of dictionaries

Basic operations

More operations

For our examples

Implementing dictionaries

Hashing schemes - basics

Hash functions

Why do collisions happen?

Separate chaining

Example

Performance

Embellishments

Open addressing

Linear probing

Primary clustering phenomenon

Linear probing -- clustering

Performance

Performance

Performance

Choosing the hash function

Double hashing

Double hashing

Performance

Performance

Open addressing performance

Rules of thumb

Choosing the hash function

Choosing the hash function

More hash functions

Caveats

Universal hashing

Properties

Fingerprinting

Why fingerprint?

Fingerprinting schemes

Rabin’s scheme

Nice extra properties

Bloom filters

Better solution:

Example

Perfect hashing

 Author: Anna Karlin + Andrei Broder

Email: karlin@cs.washington.edu

Home Page: http://www.cs.washington.edu/education/courses/589

Download presentation source