Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Department of Computer Science and Engineering Chalmers University of Technology SG¨oteborg, Sweden

First Page		Document Content
Date: 2011-05-18 09:50:44 Graph theory Mathematics Combinatorial optimization Computational complexity theory Routing algorithms Search algorithms Operations research Matching A* search algorithm Flow network		Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Department of Computer Science and Engineering Chalmers University of Technology SG¨oteborg, Sweden Add to Reading List Source URL: www.cse.chalmers.se Download Document from Source Website File Size: 550,55 KB Share Document on Facebook

	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 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
	Structuring Depth-First Search Algorithms in Haskell David J. King John Launchbury Department of Computing Science DocID: 1uNEx - View Document