679 search results - page 62 / 136 » Using decision problems in public key cryptography |
105
click to vote
ICTAI
2005
IEEE
15 years 7 months ago
2005
IEEE
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
137
click to vote
CSL
2007
Springer
15 years 1 months ago
2007
Springer
In a spoken dialog system, determining which action a machine should take in a given situation is a difficult problem because automatic speech recognition is unreliable and hence ...
CSE
2009
IEEE
15 years 8 months ago
2009
IEEE
—The success of a Public Key Infrastructure such as the Web of Trust (WoT) heavily depends on its ability to ensure that public keys are used by their legitimate owners, thereby ...
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
128
click to vote
ACMICEC
2003
ACM
15 years 6 months ago
2003
ACM
A multi-agent marketplace, MAGNET (Multi AGent Negotiation Testbed), is a promising solution to conduct online combinatorial auctions. The trust model of MAGNET is somewhat diffe...