Sciweavers

705 search results - page 103 / 141
» Approximating Extended Answer Sets
Sort
View
158
Voted
ESA
2006
Springer
139views Algorithms» more  ESA 2006»
15 years 7 months ago
Stochastic Shortest Paths Via Quasi-convex Maximization
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
ESANN
2007
15 years 4 months ago
The Recurrent Control Neural Network
This paper presents our Recurrent Control Neural Network (RCNN), which is a model-based approach for a data-efficient modelling and control of reinforcement learning problems in di...
Anton Maximilian Schäfer, Steffen Udluft, Han...
NIPS
1996
15 years 4 months ago
Early Brain Damage
Optimal Brain Damage (OBD) is a method for reducing the number of weights in a neural network. OBD estimates the increase in cost function if weights are pruned and is a valid app...
Volker Tresp, Ralph Neuneier, Hans-Georg Zimmerman...
122
Voted
ICML
2010
IEEE
15 years 4 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag
120
Voted
CORR
2010
Springer
166views Education» more  CORR 2010»
15 years 3 months ago
The dynamics of message passing on dense graphs, with applications to compressed sensing
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
Mohsen Bayati, Andrea Montanari