Concept
Heuristic (computer science)
Related lectures (32)
Deliberative Agents: Planning and Strategies
Covers planning with adversaries, heuristic search algorithms, and strategies for games with chance, emphasizing the significance of deliberative agents.
Search Algorithms: Abductive Reasoning
Explores abductive reasoning, search algorithms, and heuristic search for problem-solving.
Optimization Heuristics: Example of INGRES Database System
Explores heuristic-based optimization using the INGRES database system example.
Nonlinear Optimization Methods
Covers methods for solving nonlinear optimization problems, including direct search, Newton-Raphson, and branch and bound.
Statistical Physics: Spin Glasses & Optimization
Explores the Curie-Weiss model, spin glasses, and optimization problems in statistical physics.
Optimal Transport: Prokhorov Theorem
Covers the Prokhorov Theorem in Optimal Transport, emphasizing support sets and optimality conditions.
Ant Colony Optimization: Routing and Optimization
Explores Ant Colony Optimization (ACO) for routing and optimization, discussing constructive heuristics, local search, pheromone mechanisms, and real-world applications.
Constraint Satisfaction: Formulation and Algorithms
Covers the formulation of constraint satisfaction problems and systematic algorithms for solving them efficiently.
Code Optimization: Speeding-up Analyses
Explores techniques to speed up dataflow analyses and discusses the importance of node ordering and post-order traversal.
Register Allocation Using Graph Coloring
Covers register allocation using graph coloring to minimize memory access in programs.