هوش مصنوعیArtificial Intelligence
جستوجو، بازنمایی دانش، منطق، یادگیری ماشین و استدلال احتمالاتی.
کنکور ارشد مهندسی کامپیوتر
مباحث
کارتها · 3
A expands the frontier node of smallest f(n)=g(n)+h(n) ; an admissible heuristic makes tree-search A optimal while the stronger consistency condition is needed for graph-search A, and real-time cousins like LRTA trade optimality for a bounded O(n^2) worst case.
An intelligent agent maps percept histories to actions to maximize a performance measure; PEAS specifies the task, and it is the nature of the task environment—not the sensors, actuators, or designer—that caps how well any agent can behave.
Supervised classifiers differ by how they draw a decision boundary and how they generalize — SVM maximizes the margin using only support vectors, kernels lift data to higher dimensions, while tree ensembles do implicit feature selection and distance methods die under many irrelevant features.