8699 search results - page 363 / 1740 » Elements of the Theory of Computation |
195
Voted
UAI
2001
15 years 8 months ago
2001
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
162
Voted
NIPS
1996
15 years 8 months ago
1996
It is shown that conventional computers can be exponentially faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to conver...
176
click to vote
AAAI
2008
15 years 8 months ago
2008
Arrow’s Impossibility Theorem is one of the landmark results in social choice theory. Over the years since the theorem was proved in 1950, quite a few alternative proofs have be...
220
click to vote
JAIR
2008
15 years 6 months ago
2008
This paper presents the computational logic foundations of a model of agency called the KGP (Knowledge, Goals and Plan) model. This model allows the specification of heterogeneous...
166
click to vote
IJAR
2010
15 years 5 months ago
2010
Granular Computing is an emerging conceptual and computing paradigm of information processing. A central notion is an information-processing pyramid with different levels of clari...