7486 search results - page 387 / 1498 » The Limits of Quantum Computers |
193
click to vote
AAAI
2000
15 years 8 months ago
2000
Reinforcement learning (RL) can be impractical for many high dimensional problems because of the computational cost of doing stochastic search in large state spaces. We propose a ...
206
click to vote
AAAI
1990
15 years 8 months ago
1990
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...
146
click to vote
EUROPAR
2010
Springer
15 years 8 months ago
2010
Springer
Mutual exclusion locks limit concurrency but offer low latency. Software transactional memory (STM) typically has higher latency, but scales well. In this paper we propose transac...
198
click to vote
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
We propose an alternative algorithm for solving continuous review inventory model problems for deteriorating items over a ļ¬nite horizon. Our interest focuses on the case of timeā...
159
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We present three voting protocols with unconditional privacy and information-theoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities...