Sciweavers

13784 search results - page 331 / 2757
» On Computing Functions with Uncertainty
Sort
View
HPDC
2007
IEEE
16 years 1 months ago
Precise and realistic utility functions for user-centric performance analysis of schedulers
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...
Cynthia Bailey Lee, Allan Snavely
ICIC
2009
Springer
16 years 1 months ago
Function Sequence Genetic Programming
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...
Shixian Wang, Yuehui Chen, Peng Wu
SAC
1996
ACM
15 years 10 months ago
An enabling optimization for C++ virtual functions
Gaining the code re-use advantages of object oriented programming requires dynamic function binding, which allows a new subclass to override a function of a superclass. Dynamic bi...
Bradley M. Kuhn, David Binkley
CRYPTO
2008
Springer
163views Cryptology» more  CRYPTO 2008»
15 years 8 months ago
Cryptanalysis of the GOST Hash Function
In this article, we analyze the security of the GOST hash function. The GOST hash function, defined in the Russian standard GOST 34.11-94, is an iterated hash function producing a ...
Florian Mendel, Norbert Pramstaller, Christian Rec...
CRYPTO
2004
Springer
102views Cryptology» more  CRYPTO 2004»
15 years 10 months ago
Complete Classification of Bilinear Hard-Core Functions
Let f : {0, 1}n {0, 1}l be a one-way function. A function h : {0, 1}n {0, 1}m is called a hard-core function for f if, when given f(x) for a (secret) x drawn uniformly from {0, 1}n...
Thomas Holenstein, Ueli M. Maurer, Johan Sjöd...