All Matches
Solution Library
Expert Answer
Textbooks
Search Textbook questions, tutors and Books
Oops, something went wrong!
Change your search query and then try again
Toggle navigation
FREE Trial
S
Books
FREE
Tutors
Study Help
Expert Questions
Accounting
General Management
Mathematics
Finance
Organizational Behaviour
Law
Physics
Operating System
Management Leadership
Sociology
Programming
Marketing
Database
Computer Network
Economics
Textbooks Solutions
Accounting
Managerial Accounting
Management Leadership
Cost Accounting
Statistics
Business Law
Corporate Finance
Finance
Economics
Auditing
Hire a Tutor
AI Tutor
New
Search
Search
Sign In
Register
study help
computer science
introduction to artificial intelligence
Questions and Answers of
Introduction To Artificial Intelligence
What do Braitenberg vehicles teach us about intelligence? Do you think the intelligence given to Braitenberg vehicles could be put to some practical use?
InMichael Crichton’s novel, Prey, he postulates a multiagent system consisting of millions of tiny robotic agents. The system evolves over a period of days to develop human-like intelligence, and a
Examine the BNF definition of the syntax of a programming language such as C++, BASIC, or Java.What differences are immediately obvious compared with the BNF for a human language grammar? Are there
Implement Porter’s stemming algorithm in the programming language of your choice. You will need to find a full description of the algorithm. You can find this in Porter (1980), Spärck Jones
Find a book or web site that defines a set of rules for English grammar or the grammar of another human language. Express all of the rules in BNF and as transition networks. What problems do you
Find a machine translation service online. Have it translate a piece of text in a language with which you are not familiar into English. What errors does the translator introduce? Can you determine
Implement a language identification system in the programming language of your choice. You should start by selecting several languages (four or five should do). You should have a suitable quantity of
Why does it make sense to model computer vision systems on the human vision system? Can you think of any suitable alternative models?
Why is edge detection used as an early stage of computer vision? Can you think of any situations in which edge detection methods would fail?
Why is texture so important for computer vision systems?What differences would there be if the world had no texture and all objects were smooth and uniformly colored? Would this make it easier or
How do computer vision systems make use of motion?
Explain the way that eigenfaces are used in face recognition systems.
Apply the Waltz algorithm using pen and paper to the three-dimensional the scene is shown in Figure 21.6. Is it possible that you will end up with a different labeling from that shown in Figure
Implement an edge detection system in the programming language of your choice. You will need first to find a way to obtain pixel data from an image and convert this into a two-dimensional array of
What is intelligence?
Is Artificial Intelligence a branch of computer science or an alternative to computer science?
Why is Artificial Intelligence a worthwhile subject to study?
Explain the difference between strong and weak methods in Artificial Intelligence. Explain how this dichotomy differs from the difference between strong and weak AI.
Why are PROLOG and LISP so well suited to Artificial Intelligence research? Do you think languages such as C++ and Java could also be used for such research?
What do you think led mankind to embark upon the study of Artificial Intelligence? Which fields of study particularly fed into it? What human desires did the study of Artificial Intelligence seek to
When did Artificial Intelligence first begin to be studied? Your answer should be more detailed than a simple date.
Are there any tasks that a human can do that you think a computer could never be programmed to do? Why?
What kinds of problems that humans find difficult do you think computers are particularly well suited to solve? Are there any such problems that you know of that computers cannot currently solve but
Explain the Chinese Room argument, and present some of the arguments against it, and the counter-arguments. Which do you find most convincing? How does this affect your view on the overall worth of
If a computer passed the Turing Test, what would that prove? What conditions would you want to be sure had been observed in setting up the test?
If you replaced each of the neurons in your brain one by one with electronic neurons (take on trust for now that electronic neurons are possible), what do you think would be the effect? How would
Why are representations so important in Artificial Intelligence? What risks are inherent in using the wrong representation?
Explain why goal trees are so useful to artificial intelligence research. Give illustrations of how they are used.
Explain the connection between decision trees and the Describe and Match algorithm. How efficient do you think this algorithm is? Can you think of any ways to improve it?
Explain the problem of combinatorial explosion. What impact does this have on the methods we use for solving large problems using search?
Explain why removing cycles from a search tree is a good idea.
Explain how and-or trees can be used to represent games. What limitations do you think a system that uses game trees to play chess might face? Would it face different limitations if it played tic-tac
What is the difference between a top-down approach to solving a problem and a bottom-up approach? In what kinds of situations might each be more appropriate?
Convert the following information into:a) a semantic netb) a frame-based representation A Ford is a type of car. Bob owns two cars. Bob parks his car at home.His house is in California, which is a
Design a decision tree that enables you to identify an item from a category in which you are interested (e.g., cars, animals, pop singers, films, etc.).
Design a suitable representation and draw the complete search tree for the following problem: A farmer is on one side of a river and wishes to cross the river with a wolf, a chicken, and a bag of
Write a program using the programming language of your choice to implement the representation you designed for Review Question 3.3. Have your program solve the problem, and have it show on the screen
Write a program that solves eithera) the Towers of Hanoi problem with up to 1000 disks, or,b) the Traveling Salesman problem with up to 10 cities.You may need to wait until you have read about some
Explain the idea behind Generate and Test. Why is this method described as being exhaustive ?
What is the complexity (in space and in time) of the following search methods:■ depth-first search■ breadth-first search■ best-first search■ greedy search
What does it mean to say that a search method is monotonic? How desirable is this property? Which of the search methods described in this chapter is monotonic?
Explain why Depth-First Search Iterative Deepening is reasonably efficient. Why might it be preferable to use DFID rather than depth-first search?
Provide a definition of the word “heuristic.” In what ways can heuristics be useful in search? Name three ways in which you use heuristics in your everyday life.
Explain the components of the path evaluation function f(node) used by A*. Do you think it is the best evaluation function that could be used? To what kinds of problems might it be best suited? And
Show that A* is optimal and complete in most circumstances.
Explain why a greedy method provides suboptimal solutions to the 0-1 knapsack problem but provides optimal solutions to the fractional knapsack problem. Could there be a search tree for which greedy
What effect does the ordering of a search tree have on the efficiency of the search? What effect does it have on the quality of the results? How would order affect the way that depth-first search or
Implement a data structure that represents search trees in a programming language of your choice. Have the program display the tree on the screen, and provide functions that can select nodes and
Implement depth-first search in your program. Implement breadth-first search. Build a search tree of depth 10 and with a branching factor of 2.Which of your search methods finds a goal the most
Add the concept of path cost to your implementation. Implement A*. Does it perform much better than depth-first or breadth-first search? How well does it do with the large tree you built in Exercise
Implement a greedy-search algorithm. How well does it perform compared with the other methods you have implemented? Invent a 0-1 knapsack problem, and use your search tree implementation to model
Investigate the file search facility on your computer. Which type of search method do you think it uses? Why do you think this partic ular search method was chosen? What problems could this approach
Explain how search can be used to solve constraint satisfaction problems, such as the eight-queens problem. What difficulties arise when such problems become extremely large (e.g., the
Explain the idea behind the following heuristics:■ most-constrained variable■ most-constraining variable■ least-constraining variable■ min-conflicts
Why is local search more practical than depth-first search for solving large combinatorial optimization problems? Explain what a metaheuristic is and why it is useful.
Explain how ant colony optimization works.Why might it be useful for communications routing?
Describe in layman’s terms the idea behind simulated annealing and why it works.What kinds of problems might it be useful for solving?
Explain the purpose of the temperature variable in simulated annealing. How effective would the method be without it?
Explain why IDA* might be used instead of A*. In what kinds of situations might it be less useful?
Explain the importance of the following principles when running parallel search methods:■ task distribution■ load balancing■ tree ordering
How do search engines make use of search? Research a few of the best-known search engines, and try to find out what kind of search algorithms they use. How efficient do you think they are at
What do you think intelligence is? The Archimedean sunflower.
Read Descartes and see if you can determine whether he thought machines could reproduce themselves.
(a) Find a finite description for the set of points that are the intersections of the 24 Archimedean spirals, having equations of the formwhere k = 0,1,2, . . . ,11.(b) Find a finite description
Two other introspective philosophers were Montaigne and Pascal. What do you think their attitudes would have been toward artificial intelligence? How about Jefferson, Marx, Archimedes, and Einstein?
Construct a next-move function for a "unary multiplier," which, given an input stringconsisting of a string of m 1's followed by a string of n 1's, produces on its tape an output string containing mn
(a) Show that any Turing machine can be represented by a natural number (an integer greater than zero).(b) Give a finite description for a function f mapping the natural numbers into [0,1], such
In 1962 there were on this planet about 55,000 scientific journals publishing about 1,200,000 articles per year; there were also 60,000 scientific books and 100,000 other research reports issued per
Consider a simple "polycephalic" Turing machine which has two tapes, i1 and i2, each of which is filled completely by zero's except for a single block of 1's. Let the blocks of 1's on the two tapes
(a) For the map shown below, find the shortest path that starts at city A, visits each of the other cities only once, and then returns to A.(b) Find the path from start to finish, which passes once
Find your way out of the Maze of Dedalus.first solve the problems that are given. Next, make a list of the subproblems you considered while solving them. Discuss how a computer might be programmed to
Assign a decimal digit to each of the letters in the words "send," "more," and "money," such that when the letters are replaced by the corresponding digits the following summation is true:No digit
Nine blocks are placed in a tray as shown below,(a) How many different configurations of the blocks may be obtained by sliding them about in the tray?(b) How many different configurations of the
(a) Analyze Giveaway Chess, played as follows:(1) Captures must be made, although a player may choose which capture to make, if more than one is available.(2) Pawns must be promoted to queens if
Suppose we are given that nodes B, C, and D in Fig. 3–8 represent trivially solvable problems.Fig. 3–8 (a) What can be said about the solvability of node A?(b) What if B, C, and D are
You have a road map for the area surrounding your present location; however, because the map was produced by the Super-Duper gas-station chain, it shows only the roads in a 30-mile circle, the north
Initially three disks of different sizes, each having a hole in its center, are placed as shown in the diagram below, all of them about one of three pegs. It is desired to transfer their initial
First solve the problems that are given. Next, make a list of the subproblems you considered while solving them. Discuss how a computer might be programmed to solve each of the given problems, and
Show that it is impossible to completely cover the "mutilated-checkerboard" with 1 x 2 tiles so that the tiles neither overlap nor stick out over the edge of the board.first solve the problems that
(a) Show how White can move to gain at least a draw.(b) What subproblems did you consider in finding a solution to (a)?(c) Discuss how a computer might be programmed to solve Chess end-game
Design a computer program that, given the line drawing of the Maze of Dedalus (Exercise 3–1), can find a path out.Exercise 3–1Find your way out of the Maze of Dedalus.
Three missionaries and three cannibals are all on one bank of a river they wish to cross. They have a boat, which will hold two persons, but which can be rowed by one if necessary. If the cannibals
A certain patent attorney was astonished when he received the simultaneous allowance of five patents, for five separate clients, each of whom lived in a different city.His astonishment turned to
A monkey is in a room where a bunch of bananas is hanging from the ceiling, too high to reach. In the corner of the room is a box, which is not under the bananas. The box is sturdy enough to support
First solve the problems that are given. Next, make a list of the subproblems you considered while solving them. Discuss how a computer might be programmed to solve each of the given problems, and
Why should a depth-first search procedure always expand the most recently generated node first?
Estimate whether the complete generation and minimax evaluation of the game trees for Chess and GO can be performed by(a) A "conventional" machine;(b) An "attainable" machine;(c) A "theoretical
Investigate whether it is epistemologically adequate to describe real-world phenomena as the plays of a partially specified game, for which it is necessary to infer some of the rules. Is such a
(a) Find the optimal strategy for the game of Poker Coins, the rules of which are:(1) A player throws N coins; he then puts one or more aside and rethrows the rest.(2) This throwing is repeated
What subproblems might a computer need to solve in order to put together jigsaw puzzles?
What subproblems are involved in solving the following analogy problem? Find X such that A:B: :C:X.(Evans, 1963, reprinted with permission.) 1 о A 2 В Д 3 0 4 О C 5
Write a paper discussing the interrelationships between the problems of pattern recognition, pattern matching, pattern classification, and pattern description.
Investigate ways of describing and generating potentially infinite structures such as these: a b * BBBBBBBBBBE DXDX
What are the visual subproblems to be solved by a computer program for tying and untying knots? A Syllogism worked out. That story of yours, about your once meeting the sea-serpent, always sets me
Describe how a computer might be programmed to recognize human faces.
Show that U → V can be rewritten as ⌉ (U, ⋀V).
Find clause-form equivalents for the following formulas:(a) ∀x(P(x)→⋁(P(x),Q(x))).(b) (⌉∀xP(x)→(∃x⌉P(x)).(c) (∀x∃y⋀ (P(x),Q(x,y)))→∃>x⋀ (P(x),Q(x,x)).
Find most general unifiers for each of the following sets of literals:(a) {Q(x,a,y),Q(a,x,y)}.(b) {P(x,f(x)),P(g(x),a))}.(c) {R(u,w,f(u)),R(b,x,g(x))}.(d) {W(z,c,f(y)),W(a,x,z),W(f(y),u,g(x)}.
Use the resolution principle to derive contradictions from the negations of each of the following predicate calculus tautologies:(a) ∀x(P(x)→P(x))(b) (⌉∃xP(x)→(∀x⌉P(x))(c) (∀x⋁
Construct a predicate calculus formalization for the Missionaries-and-Cannibals Problem (Exercise 3–2); give a resolution-based proof that it is solvable and use the example-construction technique
Showing 100 - 200
of 216
1
2
3