Sciweavers

4332 search results - page 709 / 867
» A Probabilistic Identification Result
Sort
View
120
Voted
MABS
1998
Springer
15 years 8 months ago
Towards Modeling Other Agents: A Simulation-Based Study
In this paper, we present some of our ongoing experimental research towards investigating advantages of modeling other agents in multiagent environments. We attempt to quantify the...
Leonardo Garrido-Luna, Ramón F. Brena, Kati...
PKC
1998
Springer
107views Cryptology» more  PKC 1998»
15 years 8 months ago
On the Security of ElGamal Based Encryption
The ElGamal encryption scheme has been proposed several years ago and is one of the few probabilistic encryption schemes. However, its security has never been concretely proven bas...
Yiannis Tsiounis, Moti Yung
TARK
1998
Springer
15 years 8 months ago
Beating a Finite Automaton in the Big Match
We look at the Big Match game, a variation of the repeated Matching Pennies game where if the rst player plays tails the game ends with the rst player receiving the last round...
Lance Fortnow, Peter G. Kimmel
AIME
2007
Springer
15 years 8 months ago
Using Temporal Context-Specific Independence Information in the Exploratory Analysis of Disease Processes
Abstract. Disease processes in patients are temporal in nature and involve uncertainty. It is necessary to gain insight into these processes when aiming at improving the diagnosis,...
Stefan Visscher, Peter J. F. Lucas, Ildikó ...
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 8 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl