Sciweavers

139 search results - page 11 / 28
» How Common Can Be Universality for Cellular Automata
Sort
View
JPDC
2011
155views more  JPDC 2011»
12 years 10 months ago
A cellular learning automata-based deployment strategy for mobile wireless sensor networks
: One important problem which may arise in designing a deployment strategy for a wireless sensor network is how to deploy a specific number of sensor nodes throughout an unknown ne...
Mehdi Esnaashari, Mohammad Reza Meybodi
TCC
2004
Springer
134views Cryptology» more  TCC 2004»
14 years 1 months ago
A Universally Composable Mix-Net
We show how to public-key obfuscate two commonly used shuffles: decryption shuffles which permute and decrypt ciphertexts, and re-encryption shuffles which permute and re-encrypt c...
Douglas Wikström
PPSN
1994
Springer
13 years 12 months ago
Genetic L-System Programming
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
Christian Jacob
GECCO
2008
Springer
175views Optimization» more  GECCO 2008»
13 years 9 months ago
Non-genetic transmission of memes by diffusion
In recent years, there has been an increase in research activities on Memetic Algorithm (MA). MA works with memes; a meme being defined as “the basic unit of cultural transmiss...
Quang Huy Nguyen 0001, Yew-Soon Ong, Meng-Hiot Lim
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
14 years 8 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...