Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 11, Problem 33CRP
Program Plan Intro
Heuristic search:
Heuristic search method is a method of search in which goal is achieved by searching the heuristic value. The heuristic value may be based on a heuristic function. The node with highest heuristic value is chosen first as compared to other nodes which have a lower heuristic value.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Construct a graph to show how the time to complete the 10th car changes as the learning curve slope parameter is varied from 75% to 95%. The Mechanical Engineering department has a student team that is designing a formula car for national competition. The time required for the team to assemble the first car is 100 hours. Their improvement (or learning rate) is 0.8, which means that as output is doubled, their time to assemble a car is reduced by 20%. Use this information to determine, Solve, (a) the time it will take the team to assemble the 10th car. (b) the total time required to assemble the first 10 cars. (c) the estimated cumulative average assembly time for the first 10 cars. Solve by hand and by spreadsheet.
Implement an algorithmic solution, indicating which states are valid and which are not, and model the space of the following problem:
An interest group from a small town decided to sue a company for commercial abuse. For this, the people have organized themselves and decided to send 3 representatives, who will have to travel in a Van to the city where the lawsuit will be filed. The company to be sued, upon learning of these actions, has decided to send 3 lawyers to persuade the representatives, who will also travel in the same Van for that purpose.
The community must file the class action suit under these conditions:
- The three applicants must reach the destination city;
- Only two people can travel per trip in the Van (small town - city, city - small town);
- There can never be more lawyers than plaintiffs in any one place (either in the small town or city) because the lawyers can persuade the plaintiffs and as a consequence, the lawsuit would not be made;
- The Van cannot be…
a) Explain on Simulated Annealing algorithm behaves at very high temperatures,
and how it behaves at very low temperatures.
(b) Imagine the implementation of Simulated Annealing algorithm in real life. Let's
say, you have a caretaker at your home. Your home has a garden and it has a
fountain with a network of pipes that contains 150 faucets. You informed your
caretaker that you are going for short holiday to Langkawi for 3 days and when
you return you would like the fountain to spray as high as possible. Your
caretaker knows that it is impossible to check all faucets within 3 days to obtain
an optimal setting. You can use Simulated Annealing algorithm to maximize the
height of the fountain, also can assume whether a faucet can be ON or OFF and
measuring the water height. Adding to that, you can make any other
assumptions required for this scenario, explain clearly using Simulated Annealing
algorithm.
Chapter 11 Solutions
Computer Science: An Overview (12th Edition)
Ch. 11.1 - Prob. 1QECh. 11.1 - Prob. 2QECh. 11.1 - Prob. 3QECh. 11.1 - Prob. 4QECh. 11.1 - Prob. 5QECh. 11.2 - Prob. 1QECh. 11.2 - Prob. 2QECh. 11.2 - Prob. 3QECh. 11.2 - Prob. 4QECh. 11.2 - Identify the ambiguities involved in translating...
Ch. 11.2 - Prob. 6QECh. 11.2 - Prob. 7QECh. 11.3 - Prob. 1QECh. 11.3 - Prob. 2QECh. 11.3 - Prob. 3QECh. 11.3 - Prob. 4QECh. 11.3 - Prob. 5QECh. 11.3 - Prob. 6QECh. 11.3 - Prob. 7QECh. 11.3 - Prob. 8QECh. 11.3 - Prob. 9QECh. 11.4 - Prob. 1QECh. 11.4 - Prob. 2QECh. 11.4 - Prob. 3QECh. 11.4 - Prob. 4QECh. 11.4 - Prob. 5QECh. 11.5 - Prob. 1QECh. 11.5 - Prob. 2QECh. 11.5 - Prob. 3QECh. 11.5 - Prob. 4QECh. 11.6 - Prob. 1QECh. 11.6 - Prob. 2QECh. 11.6 - Prob. 3QECh. 11.7 - Prob. 1QECh. 11.7 - Prob. 2QECh. 11.7 - Prob. 3QECh. 11 - Prob. 1CRPCh. 11 - Prob. 2CRPCh. 11 - Identify each of the following responses as being...Ch. 11 - Prob. 4CRPCh. 11 - Prob. 5CRPCh. 11 - Prob. 6CRPCh. 11 - Which of the following activities do you expect to...Ch. 11 - Prob. 8CRPCh. 11 - Prob. 9CRPCh. 11 - Prob. 10CRPCh. 11 - Prob. 11CRPCh. 11 - Prob. 12CRPCh. 11 - Prob. 13CRPCh. 11 - Prob. 14CRPCh. 11 - Prob. 15CRPCh. 11 - Prob. 16CRPCh. 11 - Prob. 17CRPCh. 11 - Prob. 18CRPCh. 11 - Give an example in which the closed-world...Ch. 11 - Prob. 20CRPCh. 11 - Prob. 21CRPCh. 11 - Prob. 22CRPCh. 11 - Prob. 23CRPCh. 11 - Prob. 24CRPCh. 11 - Prob. 25CRPCh. 11 - Prob. 26CRPCh. 11 - Prob. 27CRPCh. 11 - Prob. 28CRPCh. 11 - Prob. 29CRPCh. 11 - Prob. 30CRPCh. 11 - Prob. 31CRPCh. 11 - Prob. 32CRPCh. 11 - Prob. 33CRPCh. 11 - What heuristic do you use when searching for a...Ch. 11 - Prob. 35CRPCh. 11 - Prob. 36CRPCh. 11 - Prob. 37CRPCh. 11 - Prob. 38CRPCh. 11 - Suppose your job is to supervise the loading of...Ch. 11 - Prob. 40CRPCh. 11 - Prob. 41CRPCh. 11 - Prob. 42CRPCh. 11 - Prob. 43CRPCh. 11 - Prob. 44CRPCh. 11 - Prob. 45CRPCh. 11 - Prob. 46CRPCh. 11 - Prob. 47CRPCh. 11 - Prob. 48CRPCh. 11 - Draw a diagram similar to Figure 11.5 representing...Ch. 11 - Prob. 50CRPCh. 11 - Prob. 51CRPCh. 11 - Prob. 52CRPCh. 11 - Prob. 53CRPCh. 11 - Prob. 54CRPCh. 11 - Prob. 55CRPCh. 11 - Prob. 56CRPCh. 11 - Prob. 57CRPCh. 11 - Prob. 1SICh. 11 - Prob. 2SICh. 11 - Prob. 3SICh. 11 - Prob. 4SICh. 11 - Prob. 5SICh. 11 - Prob. 6SICh. 11 - Prob. 7SICh. 11 - Prob. 8SICh. 11 - Prob. 9SICh. 11 - Prob. 10SICh. 11 - Prob. 11SICh. 11 - Prob. 12SICh. 11 - A GPS in an automobile provides a friendly voice...Ch. 11 - Prob. 14SI
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- You are given the midsem and endsem marks for the N Students in the course. A student P is said to dominate a student Q, if the midsem and endsem marks of P are both greater than the respective midsem and endsem marks of Q. Design an efficient algorithm for finding all the students that are not dominated by any other student in the class.arrow_forwardChemical reaction rates are proportional to a rate constant, k, which changes with temperature according to the Arrhenius equation k=k0e-Q/RT For a certain reaction Q = 8,000 cal/mole R = 1.987 cal/mole K k 0 = 1200 min 1 k0=1200min-1 For this question you will need to draw a graph in Matlab for the values of k for temperatures from 100 K to 500 K, in 15-degree increments.arrow_forwardIn attached image, there are 5 states, a, b, c, d, e. Two actions are available for each state: East, West except for the exit states a and e, where the only action available is “Exit”. The transition is deterministic. The rewards of the exit states are given as shown in Image. A) For γ= 1, what is the true utility ? (Please fill the form completely) Example response format: 10 10 10 10 10 (Please note the space!) B) For γ = 0.1, what is the true utility? Example response format: 10 0.1 10 10 0.1 (Please pay attention to the space!) C) For which γ are West and East equally good at state d? (please take to the fourth decimal place)Example response format: γ = 0.1234 (take to the fourth decimal place, please pay attention to the space!)arrow_forward
- please try to simulate the probability of rolling a Die with Sample Space* S={1,2,3,4,5,6} and the probability of each sample point has a 1/6 chance of occurring, i.e., you need to verify that your simulation converges to 1/6 when you select one point of sample space. When X is a random variable for sample point of rolling a Die, Pr(X<=4)=2/3. Please verify this result by simulation. Please let me know how to make an Excel file as stated above.arrow_forwardAnswer this questions True or False : Q1:lf the learning rate is too small, then gradient descent may take a very long time to converge. Q2: If 00 and 01 are initialized at a local minimum, then one iteration will not change their values Q3: If 00 and 01 are initialized so that 00=01, then by symmetry (because we do simultaneous updates to the two parameters), after one iteration of gradient descent, we will still have 00=01arrow_forwardCorrect answer will be upvoted else Multiple Downvoted. Computer science. You should stop precisely one of these boards, at any subsequent you wish. Then, at that point, the boards adjoining it get stopped one second after the fact, the boards nearby those get stopped 2 seconds after the fact, etc. At the end of the day, in the event that you stop board x, board y (for all substantial y) would be stopped precisely |x−y| seconds after the fact. For instance, assume there are 4 boards, and the 3-rd board is stopped when the digit 9 is on it. The board 1 stops 2 seconds after the fact, so it has the digit 1; the board 2 stops 1 second after the fact, so it has the digit 0; the board 4 stops 1 second after the fact, so it has the digit 0. The subsequent 4-digit number is 1090. Note that this model isn't ideal for n=4. When all boards have been stopped, you compose the digits showed on them from left to right, to frame a n digit number (it can comprise of driving…arrow_forward
- . Draw the ERD for the following scenario. In a university, a Lecturer can teach many different courses and even the same course numerous times. Courses can also be taught by many lecturers. A student is enrolled in only one program but a program can contain many students. Students can be rolled in many courses at the same time and the courses have many students enrolled.arrow_forwardSuppose a train was supposed to start at station A, pause at stationsB, C, D, ... , Y, and finish at station Z. However, it did not arrive at Z. Suppose in yourfactory the piece of equipment or process labeled A makes part B work, which in turnmakes C, D, ... , and Z work. However, Z is not working. You want to find out why.What algorithm do you use? Think of other applications of this technique.arrow_forwardI need to implement a python code for Q learning and SARSA method. My example involves a cliff walking experiment where the rewards are -1 except for the region marked as cliff if the agent steps there the reward is -100 and the agent is sent back to the start. The values used are alpha = 0.1, y or gamma = 1 and the e- greedy action is 0.1. After using these values on both algorithm the results needs to be shown by using matplot. The graph should have episodes in the x axis and sum of rewards during episode on the y axis. It needs to be smoothed out by averaging over 10 runs and, plotting moving average over last 10 episodes. This needs to be done in python using numpy and panda but I'm not allowed to use gym library or any other library.arrow_forward
- An experiment is performed and four events (A, B, C, and D) are defined over the set of all possible outcomes. Use the table below to select the pair of events that are independent: P(A) = 1/6 p(A/B) = 1/6 P(B) = 1/3 p(A/D) = 1/3 P(C) = 1/6 p(C/B) = 1/4 P(D) = 1/3 p(C/D) = 1/3arrow_forwardHow to sovle checkpoint b using while using the python code i givearrow_forwardClasses are scheduled at a school. Once students have submitted their course requests, a computer algorithm can determine the optimal schedule for everyone. The school has concluded that it will take too long to determine the best schedule. Instead, they resort to a less sophisticated method that produces a serviceable if not ideal timetable. Which guiding concept is represented here?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education