Sciweavers

151 search results - page 26 / 31
» Optimal Acceptors and Optimal Proof Systems
Sort
View
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 2 months ago
Using group selection to evolve leadership in populations of self-replicating digital organisms
This paper describes a study in the evolution of distributed cooperative behavior, specifically leader election, through digital evolution and group selection. In digital evoluti...
David B. Knoester, Philip K. McKinley, Charles Ofr...
ICISC
2004
96views Cryptology» more  ICISC 2004»
13 years 10 months ago
Efficient Broadcast Encryption Using Multiple Interpolation Methods
We propose a new broadcast encryption scheme based on polynomial interpolations. Our scheme, obtained from the Naor-Pinkas scheme by partitioning the user set and interpolating mul...
Eun Sun Yoo, Nam-Su Jho, Jung Hee Cheon, Myung-Hwa...
IACR
2011
137views more  IACR 2011»
12 years 8 months ago
Lightweight Anonymous Authentication with TLS and DAA for Embedded Mobile Devices
Although anonymous authentication has been extensively studied, so far no scheme has been widely adopted in practice. A particular issue with fully anonymous authentication schemes...
Liqun Chen, Kurt Dietrich, Hans Löhr, Ahmad-R...
ESOP
2001
Springer
14 years 1 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing
CP
2005
Springer
14 years 2 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell