2024 search results - page 58 / 405 » A Formal Model of Multi-agent Computations |
TCC
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
109
click to vote
HYBRID
1998
Springer
15 years 3 months ago
1998
Springer
This paper investigates how formal techniques can be used for the analysis and verification of hybrid systems [1,5,7,16] -- systems involving both discrete and continuous behavior....
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
Over the last decade, institutions have demonstrated that they are a powerful mechanism to make agent interactions more effective, structured, coordinated and efficient. Different...
101
click to vote
IJCAI
1993
15 years 13 days ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
IWFM
1998
15 years 14 days ago
1998
It is widely recognized that there is a body of mathematics which is crucial to the underpinning of computer science, software engineering, and information and communications tech...