6142 search results - page 235 / 1229 » The Complexity of Partition Functions |
138
click to vote
AML
1999
15 years 4 months ago
1999
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...
112
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
— 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...
176
click to vote
IH
2009
Springer
15 years 11 months ago
2009
Springer
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...
124
Voted
ISSAC
2007
Springer
15 years 11 months ago
2007
Springer
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their po...
129
click to vote
AMOST
2005
ACM
15 years 10 months ago
2005
ACM
We consider the problem of generating a set of test cases from a black box specification. We focus on stress testing, i.e. picking test cases that seem most likely to reveal prog...