Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 7
Página 67
... region , compared to the set of available moves and the directions in which they move , makes it impossible to traverse a ridge by single moves . There are some ways of dealing with these problems , 3.2 . HILL CLIMBING 67.
... region , compared to the set of available moves and the directions in which they move , makes it impossible to traverse a ridge by single moves . There are some ways of dealing with these problems , 3.2 . HILL CLIMBING 67.
Página 538
... regions , called faces . If a free face ( one not part of a solid object ) separates two free spaces , it is called a ... region of s PORTAL ( ) = 381 , 82 : FACE ( f , §1 ) ^ FACE ( ƒ , $ 2 ) ^ FREE ( $ 1 ) ^ FREE ( s2 ) ^ FREE ( ƒ ) ...
... regions , called faces . If a free face ( one not part of a solid object ) separates two free spaces , it is called a ... region of s PORTAL ( ) = 381 , 82 : FACE ( f , §1 ) ^ FACE ( ƒ , $ 2 ) ^ FREE ( $ 1 ) ^ FREE ( s2 ) ^ FREE ( ƒ ) ...
Página 566
... Regions , on the other hand , are found by grouping similar pixels together . Edge and region detection are computationally intensive processes , but ones that can be readily mapped onto parallel hardware . The next step is to infer 3 ...
... Regions , on the other hand , are found by grouping similar pixels together . Edge and region detection are computationally intensive processes , but ones that can be readily mapped onto parallel hardware . The next step is to infer 3 ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott agents algorithm answer apply approach ARMEMPTY assertions attributes axioms backpropagation backtracking backward belief best-first search breadth-first search Caesar called Chapter chess clauses complete concept conceptual dependency consider constraints contains contradiction corresponding define depth-first depth-first search described discussed domain example fact function game tree goal grammar graph heuristic Horn clauses important inference inheritance input instance interpretation isa links John justification knowledge base knowledge representation labeled learning Marcus match minimax move MYCIN natural language node object ON(B ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG represent result robot rules script Section semantic semantic net sentence shown in Figure simple slot solution solve specific step structure Suppose syntactic task techniques theorem things tree truth maintenance system understanding variables version space