2023 search results - page 261 / 405 » Human Agents and Intelligent Agents: An Experiment on the In... |
184
click to vote
AAAI
1998
15 years 7 months ago
1998
Automatedreasoning or theorem proving essentially amounts to solving search problems. Despite significant progress in recent years theorem provers still have manyshortcomings. The...
145
click to vote
AAAI
1998
15 years 7 months ago
1998
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of "heavy-tailed cost distributions", meaning that at any tim...
131
click to vote
AAAI
1998
15 years 7 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
161
click to vote
AAAI
1998
15 years 7 months ago
1998
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
157
click to vote
AAAI
1998
15 years 7 months ago
1998
The amount of use a knowledge representation system receives depends on more than just the theoretical suitability of the system. Some critical determiners of usage have to do wit...