9049 search results - page 1676 / 1810 » The New C Standard |
207
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—With the convergence of multimedia applications and wireless communications, there is an urgent need for developing new scheduling algorithms to support real-time traffic with ...
189
click to vote
JCO
2010
15 years 4 months ago
2010
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
162
click to vote
JFP
2010
15 years 4 months ago
2010
Transient faults that arise in large-scale software systems can often be repaired by re-executing the code in which they occur. Ascribing a meaningful semantics for safe re-execut...
193
click to vote
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
189
click to vote
LATINCRYPT
2010
15 years 4 months ago
2010
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...