16430 search results - page 3169 / 3286 » On Computable Tree Functions |
155
click to vote
CRYPTO
2009
Springer
15 years 11 months ago
2009
Springer
Most of the work in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side-channel attacks. Such attacks exploit various for...
133
click to vote
CRYPTO
2009
Springer
15 years 11 months ago
2009
Springer
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...
166
click to vote
EMSOFT
2009
Springer
15 years 11 months ago
2009
Springer
System-on-Chip (SoC) is a promising paradigm to implement safety-critical embedded systems, but it poses significant challenges from a design and verification point of view. In ...
146
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
147
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...