Complexity - PDFSEARCH.IO - Document Search Engine

Complexity
Results: 8084

#	Item
761	Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines! Paul C. Bell1 and Prudence W.H. Wong2 1 Department of Computer Science, Loughborough University. Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2011-05-17 19:43:16 Computational complexity theory Scheduling Operations research Computer science Theory of computation Combinatorial optimization Mathematical optimization Parallel computing Multiprocessor scheduling NC Multi-core processor Randomized algorithm
762	Chapter 1 Online Scheduling Susanne Albers University of Freiburg, Germany Add to Reading List Source URL: www14.in.tum.de Language: English - Date: 2013-11-25 10:58:01 Scheduling Computational complexity theory Operations research Mathematics Applied mathematics Analysis of algorithms Online algorithms Combinatorial optimization Makespan Job shop scheduling Algorithm Randomized algorithm
763	A Compendium on Steiner Tree Problems Editors: M. Hauptmann and M. Karpinski Department of Computer Science and Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2015-04-27 05:26:50 Computational complexity theory Graph theory Mathematics NP-complete problems Steiner tree problem Approximation algorithm APX Spanning tree Optimization problem Wiener connector Travelling salesman problem
764	Geoinformatica DOIs10707Task selection in spatial crowdsourcing from worker’s perspective Dingxiong Deng1 · Cyrus Shahabi1 · Add to Reading List Source URL: infolab.usc.edu Language: English - Date: 2016-05-21 03:16:43 Mathematics Graph theory Operations research Computational complexity theory Combinatorial optimization Mathematical optimization Travelling salesman problem Dynamic programming Algorithm Approximation algorithm Heterogeneous Earliest Finish Time Assignment problem
765	Ranking nodes according to their path-complexity Francesco Caravelli arXiv:1410.2638v2 [cond-mat.stat-mech] 15 FebDepartment of Computer Science, Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-02-16 20:34:27 Physics Information theory Statistics Mathematics Philosophy of thermal and statistical physics Thermodynamic entropy Randomness Statistical theory Entropy Random walk Von Neumann entropy Centrality
766	On-line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology Mordechai Shalom1 ? , Prudence W.H. Wong ??2 Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2009-06-10 05:42:48 Graph theory Mathematics Computational complexity theory Combinatorial optimization Routing algorithms Search algorithms Matching Randomized algorithm A* search algorithm Bipartite graph HopcroftKarp algorithm Threaded binary tree
767	Constraint Satisfaction with Counting Quantifiers⋆ Florent Madelaine1 , Barnaby Martin2⋆⋆ and Juraj Stacho3⋆ ⋆ ⋆ 2 Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2012-03-15 13:21:54 Computational complexity theory Logic Complexity classes Abstraction Metalogic Predicate logic Finite model theory IP FO Quantifier PSPACE-complete Model theory
768	REVlEW The Vapnik-Chervonenkis Dimension: Information versus Complexity in Learning Yaser S. Abu-Mostafa California Institute of Terhnohgy, Pasadcna, CAUSA Add to Reading List Source URL: authors.library.caltech.edu Language: English - Date: 2012-12-26 05:25:09 Computational learning theory Machine learning Learning Mathematics Cognition Statistical classification Empirical process VC dimension Probability distribution Artificial neural network NIP Uniform convergence
769	CS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms∗ Tim Roughgarden† November 5, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-24 22:57:16 Computational complexity theory Theory of computation Operations research Complexity classes Combinatorial optimization Analysis of algorithms Knapsack problem Simplex algorithm Time complexity Optimization problem NP Polynomial-time approximation scheme
770	Self-Improving Algorithms ∗ Nir Ailon† Bernard Chazelle† Abstract Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2006-01-17 21:15:40 Computational complexity theory Theory of computation Analysis of algorithms Time complexity NC

UPDATE