3729 search results - page 467 / 746 » On Formal Modeling of Agent Computations |
160
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...
203
click to vote
TASE
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we focus on mechanism design for single leader Stackelberg problems, which are a special case of hierarchical decision making problems in which a distinguished agent...
200
click to vote
AAAI
1990
15 years 7 months ago
1990
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...
172
click to vote
ARTS
1999
Springer
15 years 11 months ago
1999
Springer
Stochastic process algebras such as PEPA provide ample support for the component-based construction of models. Tools compute the numerical solution of these models; however, the st...
204
click to vote
CSFW
2011
IEEE
14 years 6 months ago
2011
IEEE
—We propose a much-needed formal definition of security for cryptographic key management APIs. The advantages of our definition are that it is general, intuitive, and applicabl...