1552 search results - page 181 / 311 » On the Complexity of Constant Propagation |
174
click to vote
AAAI
2012
13 years 9 months ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
189
click to vote
INFOCOM
2005
IEEE
16 years 3 days ago
2005
IEEE
With the rapid development of Internet multimedia applications, the next generation of networks is required to schedule not only the best effort traffic but also the traffic wit...
315
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
180
click to vote
DCOSS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Gradients are distributed distance estimates used as a building block in many sensor network applications. In large or long-lived deployments, it is important for the est...
168
click to vote
HOST
2008
IEEE
16 years 1 months ago
2008
IEEE
—Straightforward implementations of cryptographic algorithms are known to be vulnerable to attacks aimed not at the mathematical structure of the cipher but rather at the weak po...