<--- Back to Details
First PageDocument Content
Graph theory / Network flow / Mathematical optimization / Routing algorithms / Search algorithms / Segmentation / A* search algorithm / Maximum flow problem / Dynamic programming / Mathematics / Operations research / Applied mathematics
Date: 2014-09-14 11:24:44
Graph theory
Network flow
Mathematical optimization
Routing algorithms
Search algorithms
Segmentation
A* search algorithm
Maximum flow problem
Dynamic programming
Mathematics
Operations research
Applied mathematics

Microsoft PowerPoint - Layered-Graph-search-example.ppt [Compatibility Mode]

Add to Reading List

Source URL: www.csd.uwo.ca

Download Document from Source Website

File Size: 1,47 MB

Share Document on Facebook

Similar Documents

Game artificial intelligence / Routing algorithms / Computer programming / Computing / Mathematics / Automated planning and scheduling / Theoretical computer science / Macro / Satisficing / A* search algorithm / Planning Domain Definition Language / Heuristic

Exploiting Search Space Structure in Classical Planning: Analyses and Algorithms (Dissertation Abstract) Masataro Asai Graduate School of Arts and Sciences University of Tokyo

DocID: 1xUEX - View Document

Theoretical computer science / Automated theorem proving / Mathematics / Mathematical logic / Formal methods / Logic in computer science / Resolution / Logic programming / Clause / Vampire / Boolean satisfiability problem / CARINE

Playing with AVATAR Giles Reger, Martin Suda and Andrei Voronkov ? University of Manchester, Manchester, UK Abstract. Modern first-order resolution and superposition theorem provers use saturation algorithms to search fo

DocID: 1xTM6 - View Document

Chapter 3 Classical Optimization and Search Techniques In this chapter we discuss a few popular optimization techniques in use in current day natural language processing algorithms. First we present the Hidden Markov

DocID: 1uSjw - View Document

Line Search for Averaged Operator Iteration Pontus Giselsson, Mattias F¨alt, and Stephen Boyd Abstract Many popular first order algorithms for convex optimization, such as forward-backward splitting, Douglas-Rachford sp

DocID: 1uOGW - View Document

Graph theory / Graph connectivity / Graph traversal / Depth-first search / Bridge / Biconnected component / Cycle / Strongly connected component / Connected component / Reachability / Graph / Connectivity

Structuring Depth-First Search Algorithms in Haskell David J. King John Launchbury Department of Computing Science

DocID: 1uNEx - View Document