Sciweavers

706 search results - page 122 / 142
» On a quasi-ordering on Boolean functions
Sort
View
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
14 years 1 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
MSWIM
2004
ACM
14 years 1 months ago
Quantile models for the threshold range for k-connectivity
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
Henri Koskinen
AES
2004
Springer
151views Cryptology» more  AES 2004»
14 years 1 months ago
General Principles of Algebraic Attacks and New Design Criteria for Cipher Components
This paper is about the design of multivariate public key schemes, as well as block and stream ciphers, in relation to recent attacks that exploit various types of multivariate alg...
Nicolas Courtois
DNA
2004
Springer
14 years 1 months ago
DNA-Based Computation Times
Abstract. Speed of computation and power consumption are the two main parameters of conventional computing devices implemented in microelectronic circuits. As performance of such d...
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Petar...
ARITH
2003
IEEE
14 years 29 days ago
On Computing Addition Related Arithmetic Operations via Controlled Transport of Charge
In this paper we investigate the implementation of basic arithmetic functions, such as addition and multiplication, in Single Electron Tunneling (SET) technology. First, we descri...
Sorin Cotofana, Casper Lageweg, Stamatis Vassiliad...