2496 search results - page 335 / 500 » On covering by translates of a set |
155
click to vote
DSD
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we present a novel framework for the automated generation of Network-on-Chips (NoC) architectures, that enables architecture exploration and optimization. The au...
172
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
178
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
155
click to vote
APLAS
2009
ACM
16 years 1 months ago
2009
ACM
We present a simple algorithmic extension of the classical call-strings approach to mitigate substantial performance degradation caused by spurious interprocedural cycles. Spuriou...
141
click to vote
ASPDAC
2009
ACM
16 years 1 months ago
2009
ACM
— 1In this paper, we will present a placement method for analog circuits. We consider both common centroid and 1-D symmetry constraints, which are the two most common types of pl...