Sciweavers

116 search results - page 8 / 24
» Bisimulation for Neighbourhood Structures
Sort
View
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
13 years 5 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
14 years 26 days ago
Topological Interpretation of Crossover
Abstract. In this paper we give a representation-independent topological definition of crossover that links it tightly to the notion of fitness landscape. Building around this defi...
Alberto Moraglio, Riccardo Poli
LICS
1998
IEEE
13 years 11 months ago
A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages
In this paper we describe the promoted tyft tyxt rule format for de ning higher-order languages. The rule format is a generalization of Groote and Vaandrager's tyft tyxt form...
Karen L. Bernstein
LICS
2000
IEEE
13 years 12 months ago
Models for Name-Passing Processes: Interleaving and Causal
We study syntax-free models for name-passing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support t...
Gian Luca Cattani, Peter Sewell
ACTA
2007
96views more  ACTA 2007»
13 years 7 months ago
Recursive Petri nets
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
Serge Haddad, Denis Poitrenaud