276 search results - page 24 / 56 » The Complexity of Computing Maximal Word Functions |
FSE
2009
Springer
14 years 8 months ago
2009
Springer
The EnRUPT hash functions were proposed by O'Neil, Nohl and Henzen [5] as candidates for the SHA-3 competition, organised by NIST [4]. The proposal contains seven concrete has...
APNOMS
2009
Springer
13 years 5 months ago
2009
Springer
The inherent and increasing complexity, heterogeneity and unpredictability of computer networks make the task of managing these systems highly complex. The autonomic computing para...
RTSS
2007
IEEE
14 years 1 months ago
2007
IEEE
Many distributed real-time systems face the challenge of dynamically maximizing system utility and meeting stringent resource constraints in response to fluctuations in system wo...
FOGA
2011
12 years 11 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
COCOA
2007
Springer
14 years 1 months ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...