Sciweavers

2024 search results - page 50 / 405
» A Formal Model of Multi-agent Computations
Sort
View
JOC
2007
129views more  JOC 2007»
14 years 11 months ago
Formal Proofs for the Security of Signcryption
Signcryption is a public key or asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a lower computational and communica...
Joonsang Baek, Ron Steinfeld, Yuliang Zheng
93
Voted
IPPS
1999
IEEE
15 years 3 months ago
A Formal Definition of the Phenomenon of Collective Intelligence and its IQ Measure
This paper formalizes the concept of Collective Intelligence (C-I). Application of the Random PROLOG Processor (RPP) has allowed us to model the phenomenon of C-I in social structu...
Tadeusz Szuba
FATES
2004
Springer
15 years 4 months ago
Testing Deadlock-Freeness in Real-Time Systems: A Formal Approach
A Time Action Lock is a state of a Real-time system at which neither time can progress nor an action can occur. Time Action Locks are often seen as signs of errors in the model or ...
Behzad Bordbar, Kozo Okano
LOGCOM
2008
103views more  LOGCOM 2008»
14 years 11 months ago
Computable Models
We investigate mathematical modelling with theories of data types. We provide a formal setting for the formulation of such theories (TPL) and use it to introduce the notion of a c...
Raymond Turner
ICNS
2006
IEEE
15 years 5 months ago
Promise theory - a model of autonomous objects for pervasive computing and swarms
Abstract— The theory of promises describes policy governed services, in a framework of completely autonomous agents, which assist one another by voluntary cooperation alone. We p...
Mark Burgess, Siri Fagernes