PSU CS410/510SS: Search and Scheduling
Lecture 2
More About Search And Scheduling

Administrative

• Assignments, due dates, etc.
• Korf book comments?

Academic

• Korf: Brute Force Search
  • Pathfinding vs. CSP
  • BFS: N(b,d)=b^d(b/(b - 1))
  • DFS: Memory in combinatorial search
  • DFID (ID): N(b,d)=b^d(b/(b - 1))²
    • ``Optimal'' in time and space.
  • DFS/DFID vs. cycles (ignore sec 2.3.5 on FSMs)
  • Costs of search
    • Node selection
    • Node expansion
• Garey and Johnson: Problems, Instances, etc.
  • Problem format:
    1. Name
    2. Instance
       • state all constraints
       • parameterize everything
    3. Question
       • Concerned with decision problems
       • Optimization problems: the binary search trick
  • Review of complexity
  • P vs. NP
  • Proving problems NP Complete
  • Other interesting classes
• Bin packing
  • ``Easy'' NP-complete problem: NUMBER PARTITIONING
  • ``Harder'': BIN PACKING (can reduce from NP)
  • BIN PACKING as scheduling: jobs and shifts
  • Some observations on programming