Sciweavers

2490 search results - page 406 / 498
» The Generalized Theory of Model Preference
Sort
View
STORAGESS
2005
ACM
14 years 2 months ago
Security of erasable memories against adaptive adversaries
We study cryptographic modeling and encryption-based design techniques for guaranteeing privacy of data that is first stored in some type of computer memory and then deleted. We ...
Giovanni Di Crescenzo
EMSOFT
2005
Springer
14 years 2 months ago
A structural approach to quasi-static schedulability analysis of communicating concurrent programs
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
Cong Liu, Alex Kondratyev, Yosinori Watanabe, Albe...
FOSSACS
2005
Springer
14 years 2 months ago
Composition and Decomposition in True-Concurrency
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
Sibylle B. Fröschle
GECCO
2005
Springer
166views Optimization» more  GECCO 2005»
14 years 2 months ago
The emulation of social institutions as a method of coevolution
This paper offers a novel approach to coevolution based on the sociological theory of symbolic interactionism. It provides a multi-agent computational model along with experimenta...
Deborah Vakas Duong, John J. Grefenstette
IWINAC
2005
Springer
14 years 2 months ago
The Allele Meta-model - Developing a Common Language for Genetic Algorithms
Abstract. Due to the lot of different Genetic Algorithm variants, encodings, and attacked problems, very little general theory is available to explain the internal functioning of ...
Stefan Wagner 0002, Michael Affenzeller