Sciweavers

1241 search results - page 235 / 249
» Path-oriented random testing
Sort
View
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
13 years 10 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
ATAL
2008
Springer
13 years 8 months ago
Adaptive Kanerva-based function approximation for multi-agent systems
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
Cheng Wu, Waleed Meleis
BIOID
2008
149views Biometrics» more  BIOID 2008»
13 years 8 months ago
Additive Block Coding Schemes for Biometric Authentication with the DNA Data
Abstract. To implement a biometric authentication scheme, the templates of a group of people are stored in the database (DB) under the names of these people. Some person presents a...
Vladimir B. Balakirsky, Anahit R. Ghazaryan, A. J....
EUROCRYPT
2008
Springer
13 years 8 months ago
The Twin Diffie-Hellman Problem and Applications
ded abstract of this paper appears in Advances in Cryptology -- EUROCRYPT '08, Lecture Notes in Computer Science Vol. 4965, N. Smart ed., Springer-Verlag, 2008. This is the fu...
David Cash, Eike Kiltz, Victor Shoup
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
13 years 8 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...