8512 search results - page 309 / 1703 » Computing Theory With Relevance |
191
click to vote
IJCAI
2001
15 years 8 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
188
click to vote
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...
161
click to vote
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...
171
click to vote
AAAI
2008
15 years 7 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...
214
Voted
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...