3333 search results - page 340 / 667 » Optimal Power-Down Strategies |
169
Voted
ACNS
2010
Springer
15 years 11 months ago
2010
Springer
Most side-channel attacks that have been published in the open literature assume known- or chosen-message adversarial scenarios. In this paper, we analyze the increase of the attac...
169
click to vote
STOC
1992
ACM
15 years 10 months ago
1992
ACM
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
152
click to vote
WCNC
2010
IEEE
15 years 10 months ago
2010
IEEE
—The deployment strategy for achieving differentiated coverage and probabilistic connectivity in wireless sensor networks is studied in this paper. A novel solution based on elit...
157
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
170
click to vote
FLOPS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel exte...