982 search results - page 107 / 197 » Reduction Relations for Agent Models |
131
Voted
AAI
2004
15 years 3 months ago
2004
We are interested in applying model checking techniques to the verification of communication protocols which require safe communication. Typically, in such scenarios, one desires ...
117
Voted
SEMWEB
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We show that the Semantic Web needs a formal semantics for the various kinds of links between ontologies and other documents. We provide a model theoretic semantics that ...
141
Voted
CSFW
2009
IEEE
15 years 7 months ago
2009
IEEE
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
150
Voted
DALT
2004
Springer
15 years 9 months ago
2004
Springer
Ad hoc networks may be viewed as computational systems whose members may fail to, or choose not to, comply with the rules governing their behaviour. We are investigating to what ex...
147
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
This study proposes a simple computational model of evolutionary learning in organizations informed by genetic algorithms. Agents who interact only with neighboring partners seek ...