2766 search results - page 370 / 554 » Algorithms for trigonometric polynomials |
114
click to vote
IJCAI
1997
15 years 5 months ago
1997
Although it is acknowledged that multi-way dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain l...
136
click to vote
AAAI
1994
15 years 5 months ago
1994
So far, tractable planning problems reported in the literature have been defined by syntactical restrictions. To better exploit the inherent structure in problems, however, it is ...
126
click to vote
AAAI
1996
15 years 5 months ago
1996
We formalize a model for supervised learning of action strategies in dynamic stochastic domains and show that PAC-learning results on Occam algorithms hold in this model as well. W...
108
click to vote
NIPS
1993
15 years 5 months ago
1993
We present a new algorithm for eliminating excess parameters and improving network generalization after supervised training. The method, \Principal Components Pruning (PCP)",...
131
click to vote
AAAI
1990
15 years 5 months ago
1990
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...