29918 search results - page 5855 / 5984 » A computational model of belief |
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
ASIACRYPT
2007
Springer
15 years 4 months ago
2007
Springer
An extended abstract of this paper appears in Kaoru Kurosawa (Ed.): Advances in Cryptology ASIACRYPT 2007, volume 4833 of Lecture Notes in Computer Science, pages 265–282, Spring...
ASIACRYPT
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Whereas encryption schemes withstanding passive chosenplaintext attacks (CPA) can be constructed based on a variety of computational assumptions, only a few assumptions a...
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
CADE
2007
Springer
15 years 4 months ago
2007
Springer
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...