Sciweavers

7758 search results - page 1486 / 1552
» On the Number of Distributive Lattices
Sort
View
FOCS
2004
IEEE
14 years 1 months ago
Universally Composable Protocols with Relaxed Set-Up Assumptions
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...
Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafa...
FPGA
2004
ACM
163views FPGA» more  FPGA 2004»
14 years 1 months ago
Time and area efficient pattern matching on FPGAs
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
Zachary K. Baker, Viktor K. Prasanna
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
14 years 1 months ago
Sporadic model building for efficiency enhancement of hierarchical BOA
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...
Martin Pelikan, Kumara Sastry, David E. Goldberg
GECCO
2006
Springer
215views Optimization» more  GECCO 2006»
14 years 1 months ago
A multi-chromosome approach to standard and embedded cartesian genetic programming
Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) that can automatically acquire, evolve and re-use partial solutions in the for...
James Alfred Walker, Julian Francis Miller, Rachel...
GECCO
2006
Springer
180views Optimization» more  GECCO 2006»
14 years 1 months ago
Growth of self-canceling code in evolutionary systems
This research examines the behavior of inoperative code (introns) in the evolution of genetically robust solutions. Genetically robust solutions are solutions that are less likely...
Xue Zhong, Terence Soule
« Prev « First page 1486 / 1552 Last » Next »