Sciweavers

9842 search results - page 1684 / 1969
» Problem complexity
Sort
View
AAAI
1996
15 years 8 months ago
Total-Order Multi-Agent Task-Network Planning for Contract Bridge
This paper describes the results of applying a modified version of hierarchical task-network (HTN) planning to the problem of declarer play in contract bridge. We represent inform...
Stephen J. J. Smith, Dana S. Nau, Thomas A. Throop
AIPS
1996
15 years 8 months ago
Modeling Probabilistic Actions for Practical Decision-Theoretic Planning
Mostexisting decision-theoretic planners represent uncertainty about the state of the world with a precisely specified probability distribution over world states. This representat...
AnHai Doan
ANLP
1994
80views more  ANLP 1994»
15 years 8 months ago
Improving Language Models by Clustering Training Sentences
Many of the kinds of language model used in speech understanding suffer from imperfect modeling of intra-sentential contextual influences. I argue that this problem can be address...
David M. Carter
IJCAI
1993
15 years 8 months ago
A Metalogic Programming Approach to Reasoning about Time in Knowledge Bases
The problem of representing and reasoning about two notions of time that are relevant in the context of knowledge bases is addressed. These are called historical time and belief t...
Suryanarayana M. Sripada
NIPS
1993
15 years 8 months ago
Analyzing Cross-Connected Networks
The non-linear complexities of neural networks make network solutions difficult to understand. Sanger's contribution analysis is here extended to the analysis of networks aut...
Thomas R. Shultz, Jeffrey L. Elman
« Prev « First page 1684 / 1969 Last » Next »