Sciweavers

2905 search results - page 317 / 581
» Formal Memetic Algorithms
Sort
View
APLAS
2005
ACM
15 years 9 months ago
Race Conditions in Message Sequence Charts
Message Sequence Charts (MSCs) are a graphical language for the description of scenarios in terms of message exchanges between communicating components in a distributed environment...
Chien-An Chen, Sara Kalvala, Jane Sinclair
ATAL
2005
Springer
15 years 9 months ago
A negotiation model for autonomous agents: key features and comparison with existing models
This paper presents the key features of a new negotiation model for autonomous agents. The model is generic, handles multi-party and multi-issue negotiation, acknowledges the role...
Fernando Lopes, Augusto Q. Novais, Nuno J. Mamede,...
126
Voted
CAV
2005
Springer
86views Hardware» more  CAV 2005»
15 years 9 months ago
Syntax-Driven Reachable State Space Construction of Synchronous Reactive Programs
We consider in the current paper the issue of exploiting the structural form of Esterel programs [BG92] to partition the algorithmic RSS (reachable state space) fix-point construc...
Eric Vecchié, Robert de Simone
137
Voted
CCS
2005
ACM
15 years 9 months ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet
125
Voted
CIE
2005
Springer
15 years 9 months ago
The Transfinite Action of 1 Tape Turing Machines
• We produce a classification of the pointclasses of sets of reals produced by infinite time turing machines with 1-tape. The reason for choosing this formalism is that it appa...
Philip D. Welch