Computation - PDFSEARCH.IO - Document Search Engine

Computation
Results: 6765

#	Item
771	CS264: Homework #8 Due by midnight on Wednesday, November 19, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should also complete Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-14 09:53:16 Computational complexity theory Operations research Theory of computation Mathematics Knapsack problem Optimization problem NP Mathematical optimization Polynomial-time approximation scheme Dynamic programming Time complexity Isolation lemma
772	On the Hardness of Being Truthful Christos Papadimitriou Michael Schapira Add to Reading List Source URL: www.dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:56 Theory of computation Complexity classes Mathematics Theoretical computer science Valuation Submodular set function NC NP Reduction P/poly
773	Approximate Bayesian Computation for Granular and Molecular Dynamics Simulations Lina Kulakova Computational Science and Engineering Laboratory ETH Zürich Add to Reading List Source URL: www.cse-lab.ethz.ch Language: English - Date: 2016-06-15 20:10:57 Statistics Statistical theory Bayesian statistics Estimation theory Probability distributions Statistical models Uncertainty quantification Bayesian network Bayesian inference Sufficient statistic Likelihood function Normal distribution
774	Output-Sensitive Construction of the Union of Triangles Esther Ezra and Micha Sharir School of Computer Science Add to Reading List Source URL: www.math.tau.ac.il Language: English - Date: 2007-08-27 22:45:23 Computational complexity theory Theory of computation Analysis of algorithms NP-complete problems Set cover problem Randomized algorithm Time complexity Minimum spanning tree Point location
775	Microsoft Word - IBSAlgorithms.doc Add to Reading List Source URL: foibg.com Language: English - Date: 2015-02-02 08:45:53 Diagrams Models of computation Software engineering Concurrency Message sequence chart Abstraction Petri net Infographics Computing Model checking Tree Algorithm
776	Computing Fundamentals Advanced functions & Recursion Salvatore Filippone–2015 Add to Reading List Source URL: people.uniroma2.it Language: English - Date: 2015-05-28 11:41:55 Software engineering Computer programming Recursion Computability theory Theory of computation Subroutines Theoretical computer science Infinite loop This Anonymous function Stack Mutual recursion
777	MCS 441 – Theory of Computation I Spring 2016 Problem Set 1 Lev Reyzin Due: at the beginning of class Instructions: Atop your problem set, please write your name and whether you are an undergraduate or graduate Add to Reading List Source URL: homepages.math.uic.edu Language: English - Date: 2016-02-03 00:10:01 Finite automata Regular language Nondeterministic finite automaton
778	Approximability Results for the p-Center Problem Stefan Buettcher Course Project Algorithm Design and Analysis Add to Reading List Source URL: stefan.buettcher.org Language: English - Date: 2004-09-19 21:38:52 Computational complexity theory Theory of computation Mathematics NP-complete problems Set cover problem NP Dominating set Approximation algorithm Metric k-center Optimization problem Reduction P versus NP problem
779	What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:56:58 Computational complexity theory Complexity classes Theory of computation NP P Reduction Time complexity
780	Improved Parallel Integer Sorting without Concurrent Writing Susanne Albersyz Torben Hagerupy Add to Reading List Source URL: www14.in.tum.de Language: English - Date: 2013-11-25 11:07:42 Sorting algorithms Mathematics Order theory Theory of computation Radix sort Bitonic sorter Time complexity Merge sort Integer sorting Computational complexity theory Algorithm Big O notation

UPDATE