NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
901	Minimal Landmarks for Optimal Delete-Free Planning Patrik Haslum, John Slaney and Sylvie Thi´ebaux Optimisation Research Group, NICTA Research School of Computer Science, Australian National University firstname.lastnam Add to Reading List Source URL: users.cecs.anu.edu.au Language: English - Date: 2012-08-12 05:41:58 Heuristics Operations research Combinatorial optimization NP-complete problems Mathematical optimization Heuristic function Algorithm Approximation algorithm Greedy algorithm Mathematics Theoretical computer science Applied mathematics
902	Development of a Natural Resource Management Investment Decision Support System Marinoni, O., Higgins, A., Hajkowicz S. CSIRO Sustainable Ecosystems, 4067 St Lucia Qld Email: Keywords: Water mana Add to Reading List Source URL: www.mssanz.org.au Language: English - Date: 2013-01-16 21:02:38 Operations research Mathematical optimization Combinatorial optimization Decision theory NP-complete problems Genetic algorithm Knapsack problem Tabu search Multi-criteria decision analysis Applied mathematics Theoretical computer science Mathematics
903	RN or NP Application for UAB Clinical Training Academy (CTA) Applicant: To complete this application form, place your cursor in the shaded fields and begin typing. The fields will expand as you type. Please be sure to Add to Reading List Source URL: services.medicine.uab.edu Language: English - Date: 2012-07-16 16:44:39 Palliative care American Academy of Hospice and Palliative Medicine Hospice and palliative medicine Nursing Hospice care in the United States Nurse practitioner Medicine Hospice Palliative medicine
904	On Teaching the Basics of Complexity Theory (In Memory of Shimon Even [1935{2004]) Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Israel. Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:25:22 Complexity classes NP-complete NP-hard P versus NP problem Co-NP NP Cook–Levin theorem Oracle machine Reduction Theoretical computer science Computational complexity theory Applied mathematics
905	Automated Discovery of Composite SAT Variable-Selection Heuristics Alex Fukunaga Computer Science Department University of California, Los Angeles [removed] Add to Reading List Source URL: www.genetic-programming.org Language: English - Date: 2006-11-17 21:23:57 Constraint programming Mathematics Operations research Heuristics WalkSAT NP-complete problems Boolean satisfiability problem Local search Search algorithm Theoretical computer science Applied mathematics Logic in computer science
906	Generation of simple quadrangulations of the sphere Gunnar Brinkmann Sam Greenberg Fakult¨at f¨ Add to Reading List Source URL: cs.anu.edu.au Language: English - Date: 2003-05-07 09:06:36 Planar graphs Edge contraction Graph Connectivity Geometric graph theory NP-complete problems Line graph Path decomposition Graph theory Mathematics Graph operations
907	IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, VOL. 10, NO. 4, OCTOBER[removed]Counting Moving Bodies Using Sparse Sensor Beams Lawrence H. Erickson, Graduate Student Member, IEEE, Jingjin Yu, Student Member, Add to Reading List Source URL: msl.cs.uiuc.edu Language: English - Date: 2014-07-26 13:30:08 NP-complete problems Graph coloring Planar graphs Edge coloring Planar separator theorem Graph theory Connectivity Regular graph
908	Large Scale Graph Algorithms A Guide to Web Research: Lecture 2 Yury Lifshits Steklov Institute of Mathematics at St.Petersburg Stuttgart, Spring 2007 Add to Reading List Source URL: yury.name Language: English - Date: 2007-03-02 22:59:34 NP-complete problems Handshaking lemma Clique Graph theory Theoretical computer science Mathematics
909	How Hard Is It to Control an Election by Breaking Ties? Nicholas Mattei1 and Nina Narodytska2 and Toby Walsh3 Abstract. We study the computational complexity of controlling the result of an election by breaking ties stra Add to Reading List Source URL: www.nickmattei.net Language: English - Date: 2014-12-04 03:20:52 Political philosophy Social choice theory Electoral systems Voting systems Psephology Borda count Approval voting NP-complete NP-hard Single winner electoral systems Voting Complexity classes
910	Microsoft Word[removed]doc Add to Reading List Source URL: zhangroup.aporc.org Language: English - Date: 2009-11-18 06:34:47 Sudoku NP-complete problems Puzzle video games Sudoku algorithms Mathematics of Sudoku Backtracking Puzzle Mathematics Logic puzzles Recreational mathematics

UPDATE