growth-factor
发表于 2025-3-25 06:11:47
Network Search Algorithms with Modifiable Heuristics,s In a recent study, L. Mero suggested a method for run-time modification of heuristic estimate of nodes. This method of modifiable heuristics can in general reduce the total number of node expansions. It is shown in this paper, with counter examples, that Mero’s algorithm (B′) is not as good as cla
浪荡子
发表于 2025-3-25 08:57:45
Optimal Path-Finding Algorithms,ractions. For a given source of knowledge, we explore optimal algorithms in terms of time, space, and cost of solution path, and quantify their performance. In the absence of any knowledge, a depth-first iterative-deepening algorithm is asymptotically optimal in time and space among minimal-cost exp
HERE
发表于 2025-3-25 11:59:29
http://reply.papertrans.cn/87/8631/863046/863046_23.png
中世纪
发表于 2025-3-25 19:41:52
http://reply.papertrans.cn/87/8631/863046/863046_24.png
使熄灭
发表于 2025-3-25 23:18:32
Backtrack-Free and Backtrack-Bounded Search,ese relate the structure of the problem to the structure of the search sequence. Particular attention is paid to tree-structured constraint satisfaction problems. Problem complexity is shown to have a bound exponential in the size of the largest biconnected component of the problem’s constraint grap
持久
发表于 2025-3-26 02:20:42
Network-Based Heuristics for Constraint-Satisfaction Problems,. While some CSPs are hard, those that are easy can often be mapped into sparse networks of constraints which, in the extreme case, are trees. This paper identifies classes of problems that lend themselves to easy solutions, and develops algorithms that solve these problems optimally. The paper then
把…比做
发表于 2025-3-26 07:24:45
http://reply.papertrans.cn/87/8631/863046/863046_27.png
insomnia
发表于 2025-3-26 10:43:16
Comparison of the Minimax and Product Back-Up Rules in a Variety of Games,e-hole kalah, othello, and Ballard’s incremental game. In three-hole kalah, the product rule plays better than a minimax search to the same depth. This is a remarkable result, since it is the first widely known game in which product has been found to yield better play than minimax. Furthermore, the
加剧
发表于 2025-3-26 13:07:34
d operations research. Combinatorial optimization, decision analysis, game playing, learning, planning, pattern recognition, robotics and theorem proving are some of the areas in which search algbrithms playa key role. Less than a decade ago the conventional wisdom in artificial intelligence was tha
pacifist
发表于 2025-3-26 16:58:31
http://reply.papertrans.cn/87/8631/863046/863046_30.png