4843 search results - page 564 / 969 » The Shortcut Problem - Complexity and Approximation |
138
click to vote
NIPS
2000
15 years 6 months ago
2000
The problem of reinforcement learning in large factored Markov decision processes is explored. The Q-value of a state-action pair is approximated by the free energy of a product o...
142
Voted
AAAI
1996
15 years 6 months ago
1996
In recent years, compositional modeling and selfexplanatory simulation techniques have simplified the process of building dynamic simulators of physical systems. Building steady-s...
120
Voted
DAGSTUHL
1990
15 years 6 months ago
1990
A connectionist model for robust reasoning, CONSYDERR, is proposed to account for some common reasoning patterns found in commonsense reasoning and to remedy the brittleness probl...
141
click to vote
ESA
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We study the problem of designing group-strategyproof costsharing mechanisms. The players report their bids for getting serviced and the mechanism decides a set of player...
162
click to vote
GRC
2010
IEEE
15 years 6 months ago
2010
IEEE
We present a problem of factor analysis of three-way binary data, i.e. data described by a 3-dimensional binary matrix I, describing a relationship between objects, attributes, an...