3787 search results - page 551 / 758 » The Use of Agents Techniques on Intelligent Tutoring Systems |
169
click to vote
AAAI
2010
15 years 8 months ago
2010
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
164
click to vote
AAAI
2010
15 years 8 months ago
2010
It is well known that there cannot be a single "best" heuristic for optimal planning in general. One way of overcoming this is by combining admissible heuristics (e.g. b...
152
click to vote
AAAI
2006
15 years 8 months ago
2006
Localization is a fundamental challenge for autonomous robotics. Although accurate and efficient techniques now exist for solving this problem, they require explicit probabilistic...
164
click to vote
AAAI
2006
15 years 8 months ago
2006
Many lower bound computation methods for branch and bound Max-SAT solvers can be explained as procedures that search for disjoint inconsistent subformulas in the Max-SAT instance ...
143
click to vote
AAAI
2006
15 years 8 months ago
2006
Forward pruning, or selectively searching a subset of moves, is now commonly used in game-playing programs to reduce the number of nodes searched with manageable risk. Forward pru...