<--- Back to Details
First PageDocument Content
Search algorithms / NP-complete problems / Heuristics / Approximation algorithm / Computational complexity theory / Heuristic function / Minimax / Algorithm / Closest string / Mathematics / Theoretical computer science / Applied mathematics
Date: 2013-09-14 08:17:58
Search algorithms
NP-complete problems
Heuristics
Approximation algorithm
Computational complexity theory
Heuristic function
Minimax
Algorithm
Closest string
Mathematics
Theoretical computer science
Applied mathematics

Add to Reading List

Source URL: pages.cs.aueb.gr

Download Document from Source Website

File Size: 191,99 KB

Share Document on Facebook

Similar Documents

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

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

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

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

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

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

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

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

DocID: 1uNEx - View Document