CS264: Homework - Group 3 - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-09-29 11:39:15 Computational complexity theory Mathematics Applied mathematics Packing problems Operations research Algorithm Mathematical logic Theoretical computer science Online algorithm Bin packing problem Sorting algorithm Knapsack problem		CS264: Homework #1 Due by the beginning of class on Wednesday, October 1, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at htt Add to Reading List Source URL: theory.stanford.edu Download Document from Source Website File Size: 113,61 KB Share Document on Facebook

	A Java Framework for (Online) Algorithm Selection With Use Case on the Generalized Assignment Problem Hans Degroote1, José Luis González Velarde² and Patrick De Causmaecker1 1KU Leuven Department of Computer Science - DocID: 1vjco - View Document
	International Journal of Computer Science and Software Engineering (IJCSSE), Volume 6, Issue 7, July 2017 ISSN (Online): www.IJCSSE.org Page: A Modified Simplified Data Encryption Standard Algorithm DocID: 1uAKb - View Document
	Online Algorithm Selection Hans Degroote1, Bernd Bischl2, Lars Kotthoff3 and Patrick De Causmaecker1 1KU Leuven, Department of Computer Science - CODeS & imec-ITEC 2Department of Statistics, LMU Munich DocID: 1uxhy - View Document
	An Efficient, Sparsity-Preserving, Online Algorithm for Low-Rank Approximation David Anderson * 1 Ming Gu * 1 Abstract DocID: 1tG55 - View Document
	A Relaxed Algorithm for Online Matrix Inversion Arne Storjohann Shiyun Yang DocID: 1tr7i - View Document