NP - PDFSEARCH.IO - Document Search Engine

NP
Results: 11236

#	Item
711	4400 University Drive MS#4A5 Fairfax, VAUSA http://cs.gmu.eduDepartment of Computer Science Add to Reading List Source URL: cs.gmu.edu Language: English - Date: 2005-02-21 13:23:30 Data mining Statistics Computational statistics Cluster analysis Geostatistics K-means clustering Robotics NP Algorithm Applied mathematics
712	IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. X, Add to Reading List Source URL: www.cs.uoi.gr Language: English - Date: 2014-10-21 22:17:09 Mathematics Operations research Computational complexity theory Combinatorics Combinatorial optimization NP-complete problems Set cover problem Greedy algorithm Heuristic Integer programming Matching Linear programming
713	ः ू 3 3 Add to Reading List Source URL: www.mof.gov.np Language: English - Date: 2016-05-29 01:45:36 Sanskrit Hindustani orthography SLP1 Indic computing Languages of Asia Language
714	Contracting a chordal graph to a split graph or a tree? Petr A. Golovach1 , Marcin Kami´ nski2 , and 1 Dani¨el Paulusma Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2011-07-20 16:48:47 Graph theory Graph operations NP-complete problems Chordal graph Clique Graph minor Edge contraction Tree decomposition Vertex Split graph Graph Independent set
715	Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and its Applications Otfried Schwarzkopf y Add to Reading List Source URL: www.math.tau.ac.il Language: English - Date: 2012-06-29 10:28:55 Graph theory Graph connectivity Topological graph theory Planar graph Graph coloring Bridge NP-complete problems Graph drawing Pathwidth Matching
716	An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2008-11-30 14:19:38 Graph theory NP-complete problems Graph operations Graph coloring Interval graph Hamiltonian path Bipartite graph Ear decomposition Indifference graph Chordal graph Cograph Strongly chordal graph
717	CS264: Beyond Worst-Case Analysis The Top 10 List∗ Tim Roughgarden† December 3, 2014 We covered a lot of concepts in this course. To appreciate this, let’s review the overarching narrative of the course via a top 1 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-24 18:09:21 Computational complexity theory Theory of computation Mathematics Analysis of algorithms Operations research Mathematical optimization NP-complete problems Smoothed analysis Algorithm Competitive analysis Best worst and average case Time complexity
718	First round Dutch Mathematical Olympiad 20 January – 30 January 2014 • Time available: 2 hours. • The A-problems are multiple choice questions. Exactly one of the five given options is correct. Please Add to Reading List Source URL: www.wiskundeolympiade.nl Language: English - Date: 2015-04-10 06:17:56 Mathematics NP-complete problems Addition Elementary arithmetic Mathematical notation Logic puzzles
719	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:45:27 Mathematics NP-complete problems Theory of computation Scheduling Theoretical computer science Combinatorial optimization Independent set Makespan Approximation algorithm Matching Operations research Truthful job scheduling
720	Puzzle "Commencement Address" by John de Cuevas Instructions: Guess the words defined by the cryptic clues (words vary in length from three to nine letters and include two proper names), then enter them in the grid one a Add to Reading List Source URL: www.puzzlecrypt.com Language: English - Date: 2013-05-26 17:52:28 NP-complete problems Leisure Logic puzzles Puzzles Crosswords Cryptic crossword

UPDATE