派博傳思國際中心

標(biāo)題: Titlebook: Artificial Intelligence Through Search; Christopher James Thornton,Benedict Boulay Book 1992 Springer Science+Business Media Dordrecht 199 [打印本頁]

作者: 珍珠無 時間: 2025-3-21 17:20
書目名稱Artificial Intelligence Through Search影響因子(影響力)

書目名稱Artificial Intelligence Through Search影響因子(影響力)學(xué)科排名

書目名稱Artificial Intelligence Through Search網(wǎng)絡(luò)公開度

書目名稱Artificial Intelligence Through Search網(wǎng)絡(luò)公開度學(xué)科排名

書目名稱Artificial Intelligence Through Search被引頻次

書目名稱Artificial Intelligence Through Search被引頻次學(xué)科排名

書目名稱Artificial Intelligence Through Search年度引用

書目名稱Artificial Intelligence Through Search年度引用學(xué)科排名

書目名稱Artificial Intelligence Through Search讀者反饋

書目名稱Artificial Intelligence Through Search讀者反饋學(xué)科排名

作者: NEEDY 時間: 2025-3-21 22:56

作者: Ossification 時間: 2025-3-22 00:26
Problem Reduction (AND/OR-tree search),In the previous chapters we have dealt exclusively with different kinds of state-space search. In that representation, there was a starting state, a goal state and intermediate states linked implicitly via a successor function. The general shape of all states was the same. They were distinguished by the values of their internal components.

作者: Melanocytes 時間: 2025-3-22 05:56
Theron Muller,John Adamson,Steven Herderng a sentence or planning a sequence of robot actions. . is one of the central issues in problem-solving systems. It becomes so whenever the system, through lack of knowledge, is faced with a choice from a number of alternatives, where each choice leads to the need to make further choices, and so on

作者: Nebulous 時間: 2025-3-22 08:58
Addressing Spoken Fluency in the Classroomnal structure and is represented simply by a token. This process is subsumed in the general class of . search and is dealt with more generally in the next chapter. We will use the example of finding a path using a map. It is easy to describe and corresponds fairly closely to the non-technical meanin

作者: avulsion 時間: 2025-3-22 13:55
Erik Jon Byker,Matthew A. Witensteinn of a physical environment to find a path from a start node to a goal node. This sort of program obviously has uses for any task which involves route planning (e.g. programming mobile robots). But in fact the program we have constructed has many other possibilities.

作者: 恫嚇 時間: 2025-3-22 19:39
https://doi.org/10.1007/978-3-031-47798-0earch space systematically but with no inkling of where a goal node is likely to be found. Recall that the programs have a “worm’s-eye” rather than a “bird’s-eye” view of the space. They just work through the space, methodically checking out every single possibility. For simple problems (small searc

作者: HUSH 時間: 2025-3-23 00:40
School Development in Tough Times, in a two-person game (e.g. chess) just need to decide at any given stage which of the possible moves is the best one. If we have a heuristic function which says how close a given state is to a goal state then the best move can be identified as the one which has the highest value of the heuristic fu

作者: 想象 時間: 2025-3-23 05:16

作者: 先鋒派 時間: 2025-3-23 06:56

作者: Incisor 時間: 2025-3-23 10:38
https://doi.org/10.1007/978-3-031-19572-3n simulates a simple form of reasoning. Backwards search corresponds to a process in which a high-level hypothesis is “proved” by invoking lower-level hypotheses and, ultimately, basic facts. Forwards-search corresponds to a process in which an attempt is made to see what conclusions can be drawn by

作者: DEMN 時間: 2025-3-23 15:34
,MicroBooNE as?a?LArTPC Detector,m the set of facts looking for the set of goals. In backwards search, the search function works backwards from the goals looking for the supporting facts. Although, normally, both the goals and the facts are . we have seen in the previous chapter that in the case where we construe goals as conclusio

作者: 機(jī)密 時間: 2025-3-23 21:15
Christine D. Tippett,Todd M. Milfordtree search can be used for route-finding, problem-solving and heuristic problem-solving, and how AND/OR-tree search can be used for planning, reasoning, parsing, expert diagnosis and concept learning. Most of these applications involve the use of some additional computational machinery and/or the c

作者: 無可非議 時間: 2025-3-24 02:06
http://image.papertrans.cn/b/image/162151.jpg

作者: Encoding 時間: 2025-3-24 02:34

作者: 持久 時間: 2025-3-24 07:57
https://doi.org/10.1007/978-94-011-2836-0Extension; Prolog; artificial intelligence; intelligence; learning; programming

作者: SPECT 時間: 2025-3-24 12:14
978-94-010-5260-3Springer Science+Business Media Dordrecht 1992

作者: Mindfulness 時間: 2025-3-24 17:22
Simple State Space Search,g of the word “search”. It is just the process of looking around systematically for a given location or object. In a sense, path-finding search is just ordinary, common-or-garden search, but cast in a computational framework.

作者: Stricture 時間: 2025-3-24 22:12
Heuristic State Space Search,h spaces) such as the water jugs problem this strategy is perfectly adequate. However, if the search space is particularly big, then exploring it exhaustively may take too much time. As it turns out, most interesting problems have . search spaces.

作者: Tailor 時間: 2025-3-24 23:44
Heuristic Search of Game Trees,nction. Unfortunately, the efficacy of this approach is greatly undermined by the foothills problem, i.e. the inability of the heuristic function to take account of states that lie “beyond” the immediate successors of the current state. This is known as the ..

作者: PUT 時間: 2025-3-25 04:01
Concept learning (description search),ns and facts as premises it is sometimes advantageous to make the search function generate the goals and/or the facts. Forwards search can be used to discover which high-level conclusions can be drawn from the given set of facts and backwards search can be used to see which sets of facts might enable the drawing of given conclusions.

作者: 廣告 時間: 2025-3-25 10:57

作者: Galactogogue 時間: 2025-3-25 13:58
https://doi.org/10.1007/978-3-031-68114-1he conclusion corresponds to the goal and the bits of evidence are just the subgoals. When we implement search rules in this way, the backward AND/OR-tree search function effectively tests whether it can draw certain conclusions from the available evidence; that is to say, it implements a form of primitive reasoning.

作者: surmount 時間: 2025-3-25 19:05

作者: 妨礙 時間: 2025-3-25 21:05
Parsing (search as analysis),he conclusion corresponds to the goal and the bits of evidence are just the subgoals. When we implement search rules in this way, the backward AND/OR-tree search function effectively tests whether it can draw certain conclusions from the available evidence; that is to say, it implements a form of primitive reasoning.

作者: overreach 時間: 2025-3-26 03:43

作者: 吝嗇性 時間: 2025-3-26 07:41
Setting the Context: China Before 1895,sidering sets of goals as a states in the previous chapter, each state could be made up of some arbitrary number of such goals. In principle, descriptions (i.e. nodes) can be as complex as we like. Provided the successor function can be computed, the search process can be applied in the usual way.

作者: 法官 時間: 2025-3-26 10:08
Planning (microworld search),sidering sets of goals as a states in the previous chapter, each state could be made up of some arbitrary number of such goals. In principle, descriptions (i.e. nodes) can be as complex as we like. Provided the successor function can be computed, the search process can be applied in the usual way.

作者: 松緊帶 時間: 2025-3-26 13:25
Addressing Spoken Fluency in the Classroomg of the word “search”. It is just the process of looking around systematically for a given location or object. In a sense, path-finding search is just ordinary, common-or-garden search, but cast in a computational framework.

作者: intrude 時間: 2025-3-26 17:43

作者: 合并 時間: 2025-3-27 00:26
School Development in Tough Times,nction. Unfortunately, the efficacy of this approach is greatly undermined by the foothills problem, i.e. the inability of the heuristic function to take account of states that lie “beyond” the immediate successors of the current state. This is known as the ..

作者: 煉油廠 時間: 2025-3-27 04:26
,MicroBooNE as?a?LArTPC Detector,ns and facts as premises it is sometimes advantageous to make the search function generate the goals and/or the facts. Forwards search can be used to discover which high-level conclusions can be drawn from the given set of facts and backwards search can be used to see which sets of facts might enable the drawing of given conclusions.

作者: zonules 時間: 2025-3-27 09:18

作者: glucagon 時間: 2025-3-27 10:09

作者: 自愛 時間: 2025-3-27 16:57

作者: 嘲弄 時間: 2025-3-27 18:31
Search-Related Techniques in AI,ng a sentence or planning a sequence of robot actions. . is one of the central issues in problem-solving systems. It becomes so whenever the system, through lack of knowledge, is faced with a choice from a number of alternatives, where each choice leads to the need to make further choices, and so on

作者: 最有利 時間: 2025-3-27 22:28
Simple State Space Search,nal structure and is represented simply by a token. This process is subsumed in the general class of . search and is dealt with more generally in the next chapter. We will use the example of finding a path using a map. It is easy to describe and corresponds fairly closely to the non-technical meanin

作者: Vulvodynia 時間: 2025-3-28 02:53
State Space Search,n of a physical environment to find a path from a start node to a goal node. This sort of program obviously has uses for any task which involves route planning (e.g. programming mobile robots). But in fact the program we have constructed has many other possibilities.

作者: Colonnade 時間: 2025-3-28 07:09