4843 search results - page 857 / 969 » The Shortcut Problem - Complexity and Approximation |
NC
1998
14 years 11 months ago
1998
Many processes are composed of a n-fold repetition of some simpler process. If the whole process can be modeled with a neural network, we present a method to derive a model of the...
93
Voted
NIPS
1998
14 years 11 months ago
1998
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...
NETWORKING
2000
14 years 11 months ago
2000
Abstract. We examine the fair allocation of capacity to a large population of best-effort connections in a typical multiple access communication system supporting some bandwidth on...
NIPS
2000
14 years 11 months ago
2000
Recent work has exploited boundedness of data in the unsupervised learning of new types of generative model. For nonnegative data it was recently shown that the maximum-entropy ge...
UAI
2000
14 years 11 months ago
2000
In this paper we address the problem of learning the structure of a Bayesian network in domains with continuous variables. This task requires a procedure for comparing different c...