PPT-Effective Heuristics for NP-Hard Problems Arising in Molecu

Richard M Karp Bangalore January 5 2011 NPHard Problems The P vs NP problem Is finding a solution to a combinatorial search problem as easy as checking a solution The answer is expected to be No. brPage 3br Understanding Heuristics Symantecs Bloodhound Technology Introduction The word heuristic was initially coined by the Greeks its original form was heuriskein which meant to discover Today the term is used almost exclusively in computer sci METHODS AND OPPORTUNITIES FOR SOLVING PROBLEMS IN THE PUBLIC SERVICE. 1. TASK 2: EXPLORE . NEW INNOVATIVE WAYS TO MEET THE PUBLIC SERVICE CHALLENGES: WHAT MUST BE DISCARDED, KEPT, INTRODUCED AND EMBRACED. By. Farnoosh Davoodi. 1. Agenda. Min Knapsack Problem. 2 approximation greedy algorithm. Proof . 3/2 approximation greedy algorithm. Proof. Another improved heuristic. Heuristics for the O-1 Min-Knapsack Problem. Nattee Niparnan. Easy & Hard Problem. What is “difficulty” of problem?. Difficult. . for . computer scientist. to derive algorithm for the problem?. Difficult for . computer. to solve (run the derived algorithm) the problem?. Evaluation: Inspections, Analytics & Models . Aims:. Describe . the key concepts associated with inspection methods. .. Explain . how to do heuristic evaluation and walkthroughs. .. Explain . the role of analytics in evaluation. Polynomial Problems (P Family). The set of problems that can be . solved. . in polynomial time . These problems form the P family . All problems we covered so far are in P. P. Nondeterministic Polynomial (NP Family). Context. Final Year. 120 credits (1 credit . approx. 10 hours). 30 credit project. 4 modules in semester 1 . 4 modules in semester 2. A module is 10 credits. 1 c. ompulsory . module on Prof Issues. Students select 4 modules from 8 in each semester. : active efforts to discover what must be done to achieve a goal that is not readily attainable. TYPES OF PROBLEMS. Problems of inducing structure. : relations among numbers, words, symbols, ideas. Problems of arrangement. The Problem with problem-solving research. “In field research, there is often too much [complexity] to allow for definitive conclusions, and in laboratory research, there is usually too little complexity to allow for any interesting conclusions”. Kenny Denmark. Jason Isenhower. Ross Roessler. Background. A* uses heuristics for efficient searching. Initially, heuristics provided by "expert". Challenge is to have program create heuristics. Many heuristics have been developed to address some particular issues related to user interface designs. For example, Pinelle et al. [11] had developed a set of ten heuristics for video game design. T is collaborating with JSTOR to digitize preserve and extend access to7KH3KLHOWDDSSDQhttp//wwwjstororgKDWV3UREOHP6ROYLQJXWKRUVf0LFKDHO0DUWLQH6RXUFH7KH3KLHOWDDSSDQ9RO1RSUfSS3XEOLVKHGE3KLHOWDDSSDQWHUQDWL Richard M. Karp. Bangalore, January 5, 2011. NP-Hard Problems. The P vs. NP problem: Is finding a solution to a combinatorial search problem as easy as checking a solution. The answer is expected to be “No.”. CHINMAYA KRISHNA SURYADEVARA. P and NP. P – The set of all problems solvable in polynomial time by a deterministic Turing Machine (DTM).. Example: Sorting and searching.. P and NP. NP- the set of all problems solvable in polynomial time by non deterministic Turing Machine (NDTM).