8824 search results - page 174 / 1765 » On the Complexity of Real Functions |
162
click to vote
GECCO
2007
Springer
16 years 19 days ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
182
click to vote
MST
2007
15 years 6 months ago
2007
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
191
click to vote
PERCOM
2011
ACM
14 years 10 months ago
2011
ACM
—This paper examines the possible uses of different market mechanisms for resource allocation at different levels of Wireless Sensor Network (WSN) architecture. The goal is to ma...
148
click to vote
AFRICACRYPT
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we analyze the SHAvite-3-512 hash function, as proposed and tweaked for round 2 of the SHA-3 competition. We present cryptanalytic results on 10 out of 14 rounds of ...
220
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...