Sciweavers

4041 search results - page 136 / 809
» time 2009
Sort
View
SAT
2009
Springer
79views Hardware» more  SAT 2009»
16 years 1 months ago
Minimizing Learned Clauses
Minimizing learned clauses is an effective technique to reduce memory usage and also speed up solving time. It has been implemented in MINISAT since 2005 and is now adopted by mos...
Niklas Sörensson, Armin Biere
CANS
2009
Springer
160views Cryptology» more  CANS 2009»
16 years 1 months ago
Short Hash-Based Signatures for Wireless Sensor Networks
We present a hash-based signature scheme customized for wireless sensor networks. For message lengths required by instructions or queries from the base station or single measuremen...
Erik Dahmen, Christoph Krauß
ESA
2009
Springer
346views Algorithms» more  ESA 2009»
16 years 1 months ago
Hash, Displace, and Compress
A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , m − 1} is called a perfect hash function (PHF) for a subset S ⊆ U of size n ...
Djamal Belazzougui, Fabiano C. Botelho, Martin Die...
RTCSA
2009
IEEE
16 years 1 months ago
Towards Real Multi-criticality Scheduling
—Componentised systems, in particular those with fault confinement through address spaces, are currently emerging as a hot topic in embedded systems research. This paper extends...
Stefan M. Petters, Martin Lawitzky, Ryan Heffernan...
ESA
2009
Springer
77views Algorithms» more  ESA 2009»
16 years 1 months ago
Short Labels for Lowest Common Ancestors in Trees
We evaluate the practical performance of labeling schemes for lowest common ancestors in trees. We develop different variants for encoding the labels. We then perform a thorough e...
Johannes Fischer