4843 search results - page 745 / 969 » The Shortcut Problem - Complexity and Approximation |
127
Voted
ICONIP
1998
15 years 5 months ago
1998
Many real processes are composed of a n-fold repetition of some simpler process. If the whole process can be modelled with a neural network, we present a method to derive a model ...
142
Voted
NIPS
1998
15 years 5 months ago
1998
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
117
Voted
IJCAI
1997
15 years 5 months ago
1997
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...
159
Voted
NIPS
1997
15 years 5 months ago
1997
There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of ...
141
Voted
COLING
1996
15 years 5 months ago
1996
We address the problem of automatically acquiring case frame patterns (selectional patterns) from large corpus data. In particular, we l)ropose a method of learning dependencies b...