Sciweavers

10054 search results - page 324 / 2011
» On the Complexity of Function Learning
Sort
View
AML
1999
86views more  AML 1999»
15 years 3 months ago
Subrecursive functions on partial sequences
The paper studies a domain theoretical notion of primitive recursion over partial sequences in the context of Scott domains. Based on a non-monotone coding of partial sequences, t...
Karl-Heinz Niggl
146
Voted
ICES
1998
Springer
131views Hardware» more  ICES 1998»
15 years 8 months ago
Aspects of Digital Evolution: Geometry and Learning
In this paper we present a new chromosome representation for evolving digital circuits. The representation is based very closely on the chip architecture of the Xilinx 6216 FPGA. W...
Julian F. Miller, Peter Thomson
ICANN
2010
Springer
15 years 5 months ago
Policy Gradients for Cryptanalysis
So-called Physical Unclonable Functions are an emerging, new cryptographic and security primitive. They can potentially replace secret binary keys in vulnerable hardware systems an...
Frank Sehnke, Christian Osendorfer, Jan Sölte...
IPPS
2009
IEEE
15 years 10 months ago
Managing the construction and use of Functional Performance Models in a Grid environment
— This paper presents a tool, the Performance Model Manager, which addresses the complexity of the construction and management of a set of Functional Performance Models on a comp...
Robert Higgins, Alexey L. Lastovetsky
165
Voted
IH
2009
Springer
15 years 10 months ago
Hardware-Based Public-Key Cryptography with Public Physically Unclonable Functions
Abstract. A physically unclonable function (PUF) is a multiple-input, multipleoutput, large entropy physical system that is unreproducible due to its structural complexity. A publi...
Nathan Beckmann, Miodrag Potkonjak