On the Optimality of Top-k Algorithms for Interactive Web Applications∗ Yael Amsterdamer Daniel Deutch

First Page		Document Content
Date: 2011-05-31 18:17:42 Computational complexity theory Mathematics Edsger W. Dijkstra Graph theory Algorithm Mathematical logic Theoretical computer science Shortest path problem NP Dynamic programming		On the Optimality of Top-k Algorithms for Interactive Web Applications∗ Yael Amsterdamer Daniel Deutch Add to Reading List Source URL: webdb2011.rutgers.edu Download Document from Source Website File Size: 170,67 KB Share Document on Facebook

	Towards a high level programming paradigm to deploy e-science applications with dynamic workflows on large scale distributed systems Mohamed Ben Belgacem Nabil Abdennadher DocID: 1xTOs - View Document
	Minimax Differential Dynamic Programming: An Application to Robust Biped Walking Jun Morimoto Human Information Science Labs, Department 3, ATR International DocID: 1vqMk - View Document
	Empirical Dynamic Programming William B. Haskell ISE Department, National University of Singapore Rahul Jain* DocID: 1vouJ - View Document
	MarchRevised MayReport LIDS-P-3506 Stable Optimal Control and Semicontractive Dynamic Programming DocID: 1vhRF - View Document
	EE365: Deterministic Finite State Control Deterministic optimal control Shortest path problem Dynamic programming Examples DocID: 1vg0M - View Document