Complexity

Results: 8084



#Item
491Academia / Engineering / Knowledge / Bioinformatics / Formal sciences / Computational thinking / Computer science / Neuroinformatics / Complexity / Mathematics / Computational science / Computational mathematics

J Sci Educ Technol:127–147 DOIs10956Defining Computational Thinking for Mathematics and Science Classrooms David Weintrop1,2 • Elham Beheshti3 • Michael Horn1,2,3 • Kai Orton1,2

Add to Reading List

Source URL: ccl.northwestern.edu

Language: English - Date: 2016-05-03 12:24:06
492Computational complexity theory / Theory of computation / Complexity classes / NP / Clique problem / Linear programming / P / Algorithm / Time complexity / Optimization problem / Book:Graph Theory / P versus NP problem

CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-01-06 16:13:01
493Computing / Network architecture / Computer networking / Internet Standards / Data management / Telecommunications engineering / Networking hardware / Border Gateway Protocol / Peering / Router / Virtual private network / Data center

NEW PARADIGMS FOR MANAGING THE COMPLEXITY AND IMPROVING THE PERFORMANCE OF ENTERPRISE NETWORKS. by Theophilus A. Benson

Add to Reading List

Source URL: users.cs.duke.edu

Language: English - Date: 2014-03-19 22:40:33
494Computing / Algorithms / Academia / Computational complexity theory / Streaming algorithm / Reservoir sampling / Sampling / Median / Sorting algorithm / Stream processing / Minimum spanning tree / Statistics

CHAPTER 8 Algorithms for Data Streams CAMIL DEMETRESCU and IRENE FINOCCHI 8.1 INTRODUCTION

Add to Reading List

Source URL: twiki.di.uniroma1.it

Language: English - Date: 2014-06-16 03:22:22
495Operations research / Mathematics / Computational complexity theory / Applied mathematics / Mathematical optimization / Heuristic / Integer programming / Relaxation / Branch and bound / Combinatorial optimization / Travelling salesman problem / Algorithm

Microsoft Word - orbs7180.doc

Add to Reading List

Source URL: www.math.hkbu.edu.hk

Language: English - Date: 2013-09-27 05:04:48
496Markov models / Probability theory / Statistics / Probability / Probabilistic complexity theory / Markov processes / Statistical models / Graph theory / Markov chain / Randomized algorithm / Stochastic process / Algorithm

Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN By

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:24
497Computational complexity theory / Mathematics / NP-complete problems / Theory of computation / Packing problems / Operations research / Approximation algorithms / Knapsack problem / Vertex cover / Bin packing problem / Hardness of approximation / Algorithm

Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2014-06-04 08:46:15
498Computational complexity theory / Mathematics / NP-complete problems / Theory of computation / Set cover problem / Approximation algorithm / Algorithm / Analysis of algorithms / Bin packing problem / Vertex cover

SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2013-03-13 08:17:47
499Machine learning / Mathematical analysis / Sample complexity / Mathematics / Analysis / Quasisymmetric map / Dirac delta function

Valid Generalisation from Approximate Interpolation Martin Anthony∗ Department of Mathematics The London School of Economics and Political Science Houghton Street, London WC2A 2AE, United Kingdom

Add to Reading List

Source URL: www.maths.lse.ac.uk

Language: English - Date: 2000-04-03 15:00:46
500Graph theory / Mathematics / Combinatorial optimization / Edsger W. Dijkstra / Matrix multiplication algorithm / NP-complete problems / Matching / Routing algorithms / Computational complexity theory / Connected component / Dynamic programming / Graph coloring

Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel †

Add to Reading List

Source URL: www.cs.huji.ac.il

Language: English - Date: 2014-11-26 08:32:33
UPDATE