1279 search results - page 202 / 256 » Fast Implementations of Automata Computations |
118
Voted
DAC
2006
ACM
15 years 6 months ago
2006
ACM
Conventionally, signal net routing is almost always implemented as Steiner trees. However, non-tree topology is often superior on timing performance as well as tolerance to open f...
130
click to vote
CLUSTER
2001
IEEE
15 years 6 months ago
2001
IEEE
This paper describes GulfStream, a scalable distributed software system designed to address the problem of managing the network topology in a multi-domain server farm. In particul...
117
click to vote
CCS
2008
ACM
15 years 4 months ago
2008
ACM
In the process of platform attestation, a Trusted Platform Module is a performance bottleneck, which causes enormous delays if multiple simultaneously attestation requests arrive ...
111
Voted
ASPDAC
2005
ACM
15 years 4 months ago
2005
ACM
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
129
Voted
EUROPAR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Understanding program behavior is at the foundation of program optimization. Techniques for automatic recognition of program constructs characterize the behavior of code ...